ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  spimt GIF version

Theorem spimt 1785
Description: Closed theorem form of spim 1787. (Contributed by NM, 15-Jan-2008.) (Revised by Mario Carneiro, 17-Oct-2016.) (Proof shortened by Wolf Lammen, 24-Feb-2018.)
Assertion
Ref Expression
spimt ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓))) → (∀𝑥𝜑𝜓))

Proof of Theorem spimt
StepHypRef Expression
1 a9e 1744 . . . 4 𝑥 𝑥 = 𝑦
2 exim 1648 . . . 4 (∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥(𝜑𝜓)))
31, 2mpi 15 . . 3 (∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)) → ∃𝑥(𝜑𝜓))
4 19.35-1 1673 . . 3 (∃𝑥(𝜑𝜓) → (∀𝑥𝜑 → ∃𝑥𝜓))
53, 4syl 14 . 2 (∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)) → (∀𝑥𝜑 → ∃𝑥𝜓))
6 19.9t 1691 . . 3 (Ⅎ𝑥𝜓 → (∃𝑥𝜓𝜓))
76biimpd 144 . 2 (Ⅎ𝑥𝜓 → (∃𝑥𝜓𝜓))
85, 7sylan9r 410 1 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓))) → (∀𝑥𝜑𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1396   = wceq 1398  wnf 1509  wex 1541
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1496  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-4 1559  ax-i9 1579  ax-ial 1583
This theorem depends on definitions:  df-bi 117  df-nf 1510
This theorem is referenced by:  spimd  16524
  Copyright terms: Public domain W3C validator