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