proposition: Lemma eval_or_list_rev_append : forall l1 l2, eval_or_list' (rev_append l1 l2) <-> (eval_or_list' l1 \/ eval_or_list' l2).
proof: Proof. induction l1 ; simpl. - tauto. - intros. rewrite IHl1. simpl. tauto. Qed.
imports: Bool ZifyBool ZArith ZifyUint63 Uint63 Lia List Cdcl.Lib Cdcl.Syntax Cdcl.Lit