proposition: Lemma has_form_lop : forall m o l hf (WF : has_form m hf) (EQ : elt hf = LOP o l), Forall (has_form m) l.
proof: Proof. intros. inv WF ; try discriminate. inv EQ. auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause