proposition: Lemma hold_eval_TT : forall k, hold k (eval_TT k) <-> True.
proof: Proof. destruct k ; simpl. tauto. unfold is_true. tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause