proposition: 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).
proof: Proof. intuition. unfold dat_correct in *. edestruct low_tree_approx_same_h. eauto. trivial. destruct H1. econstructor. econstructor. intuition. simpl in *. eauto. eauto. rewrite H4. eapply eqRat_refl. Qed.
imports: FCF.Comp FCF.DetSem FCF.DistSem FCF.Rat Arith FCF.StdNat FCF.Fold FCF.Limit Permutation ZifyNat