have ⟨R,l₄⟩ := nonconstruction h₁.left
t u : Th
p : Pr
h₁✝ : formalApplicationFunction t u ≤ ↑p
Δ : Set Form := { f | ¬formalApplication (↑t) (▲{f}) ⊆ ↑↑p }
l₂ : ↑u ∩ Δ = ∅
P Q : Form
h₁ : P ∈ Δ ∧ Q ∈ Δ
h₂ : formalApplication (↑t) (▲{P¦Q}) ⊆ ↑↑p
⊢ False
t u : Th
p : Pr
h₁✝ : formalApplicationFunction t u ≤ ↑p
Δ : Set Form := { f | ¬formalApplication (↑t) (▲{f}) ⊆ ↑↑p }
l₂ : ↑u ∩ Δ = ∅
P Q : Form
h₁ : P ∈ Δ ∧ Q ∈ Δ
h₂ : formalApplication (↑t) (▲{P¦Q}) ⊆ ↑↑p
R : Form
l₄ : ¬(R ∈ formalApplication (↑t) (▲{P}) → R ∈ ↑↑p)
⊢ False