proposition: Lemma eval_mklform : forall f, eval_formula (elt (mklform f)) <-> eval_formula (elt f).
proof: Proof. unfold mklform. intros. destruct (is_TT (elt f)) eqn:EQ; try tauto. apply is_TT_true in EQ. rewrite EQ. simpl. tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause