proposition: Lemma eq_sound_prover : forall P Q, eq_prover P Q -> (forall st, sound_prover P st) -> forall st : state, sound_prover Q st.
proof: Proof. unfold sound_prover; intros. rewrite <- H in PRF. eauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause