simpa using hΓ
α : Type u_1
Λ : AxiomSet α
inst✝³ : Inhabited α
inst✝² : DecidableEq α
t : Axioms.Geach.Taple
L : DeductionParameter α
inst✝¹ : L.HasNecOnly
includeK : L.IncludeK
inst✝ : Inhabited (MCT L)
hAx : 𝗴𝗲(t) ⊆ Ax(L)
this : L.Normal
Ω₁ Ω₂ Ω₃ : (CanonicalFrame L).World
r₁₂ : Ω₁ ≺^[t.i] Ω₂
r₁₃ : Ω₁ ≺^[t.j] Ω₃
Γ Δ : List (Formula α)
hΓ : ∀ p ∈ Γ, p ∈ □''⁻¹^[t.m]Ω₂.theory
hΔ : ∀ p ∈ Δ, p ∈ □''⁻¹^[t.n]Ω₃.theory
hC : L ⊢! Γ.conj' ⋏ Δ.conj' ⟶ ⊥
⊢ ∀ p ∈ Γ, □^[t.m]p ∈ Ω₂.theory
no goals