proposition: Lemma BDDvar_le_compare : forall x y : BDDvar, BDDcompare x y = Datatypes.Lt -> BDDvar_le x y = true.
proof: Proof. intros x y H. unfold BDDvar_le in |- *. unfold Nleb in |- *. apply leb_correct. apply lt_le_weak. apply BDDcompare_lt. assumption. Qed.
imports: Bool Sumbool Arith ZArith NArith Nnat Ndec Ndigits IntMap(Allmaps) Wf_nat BDDvar_ad_nat bdd1 bdd2 bdd3 bdd4 bdd5_1 bdd5_2