proposition: Lemma hold_eval_binop_impl : forall k f1 f2, hold k (eval_binop (fun x y => x -> y) implb k f1 f2) <-> (hold k f1 -> hold k f2).
proof: Proof. destruct k ; simpl; intros. - tauto. - split; intros. destruct f1,f2 ; unfold Is_true in *; simpl in *; auto. destruct f1,f2 ; unfold Is_true in *; simpl in *; auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause