MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axregndlem1 Structured version   Visualization version   GIF version

Theorem axregndlem1 10582
Description: Lemma for the Axiom of Regularity with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by NM, 3-Jan-2002.) (New usage is discouraged.)
Assertion
Ref Expression
axregndlem1 (∀𝑥 𝑥 = 𝑧 → (𝑥𝑦 → ∃𝑥(𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))

Proof of Theorem axregndlem1
StepHypRef Expression
1 19.8a 2217 . 2 (𝑥𝑦 → ∃𝑥 𝑥𝑦)
2 nfae 2465 . . 3 𝑥𝑥 𝑥 = 𝑧
3 nfae 2465 . . . . . 6 𝑧𝑥 𝑥 = 𝑧
4 elirrv 9555 . . . . . . . . 9 ¬ 𝑥𝑥
5 elequ1 2150 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥𝑥𝑧𝑥))
64, 5mtbii 329 . . . . . . . 8 (𝑥 = 𝑧 → ¬ 𝑧𝑥)
76sps 2221 . . . . . . 7 (∀𝑥 𝑥 = 𝑧 → ¬ 𝑧𝑥)
87pm2.21d 122 . . . . . 6 (∀𝑥 𝑥 = 𝑧 → (𝑧𝑥 → ¬ 𝑧𝑦))
93, 8alrimi 2249 . . . . 5 (∀𝑥 𝑥 = 𝑧 → ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))
109anim2i 628 . . . 4 ((𝑥𝑦 ∧ ∀𝑥 𝑥 = 𝑧) → (𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦)))
1110expcom 418 . . 3 (∀𝑥 𝑥 = 𝑧 → (𝑥𝑦 → (𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))
122, 11eximd 2252 . 2 (∀𝑥 𝑥 = 𝑧 → (∃𝑥 𝑥𝑦 → ∃𝑥(𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))
131, 12syl5 35 1 (∀𝑥 𝑥 = 𝑧 → (𝑥𝑦 → ∃𝑥(𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wal 1568  wex 1809
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404  ax-sep 5257  ax-reg 9550
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814
This theorem is referenced by:  axregndlem2  10583  axregnd  10584
  Copyright terms: Public domain W3C validator