Theorem: LO.Modal.Standard.Theory.def_not_ParametricConsistent (Logic/Modal/Standard/Kripke/Completeness.lean)

State before:
α : Type u_1
inst✝² : DecidableEq α
inst✝¹ : Inhabited α
L : DeductionParameter α
inst✝ : L.Normal
T : Theory α
⊢ ¬(L)-Consistent T ↔ ∃ Γ, (∀ p ∈ Γ, p ∈ T) ∧ L ⊢! Γ.conj' ⟶ ⊥
Tactic:
simp [ParametricConsistent]
State after:
no goals