proposition: Lemma prv_intu_peirce T φ : T ⊢I φ -> T ⊢ φ.
proof: Proof. Proof using. remember intu. induction 1. all: now eauto. Qed.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability.FOL(Syntax.Facts Syntax.Theories Syntax.Asimpl) Undecidability(Shared.ListAutomation) Lia EqdepFacts