proposition: Lemma bool_fun_if_lemma_4 : forall (x : BDDvar) (bfl1 bfr1 bf2 : bool_fun), bool_fun_eq (bool_fun_if x (bool_fun_or bfr1 bf2) (bool_fun_or bfl1 bf2)) (bool_fun_or (bool_fun_if x bfr1 bfl1) bf2).
proof: Proof. unfold bool_fun_eq, bool_fun_or, bool_fun_if in |- *. unfold bool_fun_eval in |- *. intros x bfl1 bfr1 bf2 vb. elim (vb x); simpl in |- *. reflexivity. 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