Instance length_getSupport_nz : forall (A : Set)(c : Comp A),
  well_formed_comp c ->
  nz (length (getSupport c)).

(* Specifications: *)
Lemma evalDet_lowDistApprox_ls_done: forall (A : Set) (eqd : eq_dec A) (c : Comp A) (s : Blist) (a1 a2 : A) (n : nat), evalDet c s (ca_done a1) -> lowDistApprox_ls c a2 n s (if eqd a2 a1 then 1 else 0).
Lemma evalDet_lowDistApprox_ls_not_done: forall (A : Set) (c : Comp A) (s : Blist) (a2 : A) (n : nat), well_formed_comp c -> (forall s' (a : A), In s' (getAllBlists n) -> evalDet c (s ++ s') (ca_done a) -> False) -> lowDistApprox_ls c a2 n s 0.
Lemma low_tree_approx_same_h : forall n (A : Set)(eqd : eq_dec A)(c : Comp A)(t : DistApproxTree A) ls, dat_correct_h c ls n t -> forall a, well_formed_comp c -> lowDistApprox_ls c a n ls (lowDistApproxFromTree eqd t a).
Theorem low_tree_approx_same : forall n (A : Set)(eqd : eq_dec A)(c : Comp A)(t : DistApproxTree A), well_formed_comp c -> dat_correct c n t -> forall a, lowDistApprox c a n (lowDistApproxFromTree eqd t a).
Lemma lowDistApprox_left_total : forall (A : Set)(eqd : eq_dec A)(c : Comp A) a, well_formed_comp c -> left_total (lowDistApprox c a).