proposition: Lemma lowDistApprox_bind_div2_left_total : forall (A B : Set)(c1 : Comp B)(c2 : B -> Comp A) a, well_formed_comp c1 -> (forall b, In b (getSupport c1) -> well_formed_comp (c2 b)) -> left_total (fun n => lowDistApprox_bind c1 c2 a (Nat.div2 n)).
proof: Proof. intuition. unfold left_total. intuition. eapply lowDistApprox_bind_left_total; eauto. Qed.
imports: FCF.Comp FCF.DetSem FCF.DistSem FCF.Rat Arith FCF.StdNat FCF.Fold FCF.Limit Permutation ZifyNat