proposition: Lemma bool_fun_or_one : forall bf : bool_fun, bool_fun_eq (bool_fun_or bf bool_fun_one) bool_fun_one.
proof: Proof. unfold bool_fun_eq, bool_fun_or, bool_fun_one in |- *. unfold bool_fun_eval in |- *. intros bf vb. elim (bf vb). simpl in |- *. reflexivity. simpl in |- *. reflexivity. 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