Theorem: LO.Modal.Standard.MaximalParametricConsistentTheory.iff_mem_conj' (Logic/Modal/Standard/Kripke/Completeness.lean)

State before:
α : Type u_1
inst✝² : DecidableEq α
inst✝¹ : Inhabited α
L : DeductionParameter α
inst✝ : L.Normal
Ω Ω₁ Ω₂ : MCT L
p : Formula α
Γ : List (Formula α)
⊢ Γ.conj' ∈ Ω.theory ↔ ∀ p ∈ Γ, p ∈ Ω.theory
Tactic:
simp [membership_iff, iff_provable_list_conj]
State after:
no goals