proposition: Lemma bool_fun_restrict_eq : forall (bf bf' : bool_fun) (x : BDDvar) (b : bool), bool_fun_eq bf bf' -> bool_fun_eq (bool_fun_restrict bf x b) (bool_fun_restrict bf' x b).
proof: Proof. intros bf bf' x b H. unfold bool_fun_eq in |- *. unfold bool_fun_restrict in |- *. unfold bool_fun_eval at 1 3 in |- *. intro vb. apply H. Qed.
imports: Bool Sumbool Arith ZArith NArith Nnat Ndec Ndigits IntMap(Allmaps) Wf_nat BDDvar_ad_nat bdd1 bdd2