proposition: Lemma BDDor_1_lemma_1 : forall (cfg : BDDconfig) (memo : BDDor_memo) (node1 node2 node : ad) (bound : nat), BDDor_memo_lookup memo node1 node2 = Some node -> BDDor_1 cfg memo node1 node2 bound = (cfg, (node, memo)).
proof: Proof. intros cfg memo node1 node2 node bound H. elim bound. simpl in |- *. rewrite H. reflexivity. intros n H0. simpl in |- *; rewrite H; 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 bdd6