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

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

Proof of Theorem axregndlem1
StepHypRef Expression
1 19.8a 2220 . 2 (𝑥𝑦 → ∃𝑥 𝑥𝑦)
2 nfae 2467 . . 3 𝑥𝑥 𝑥 = 𝑧
3 nfae 2467 . . . . . 6 𝑧𝑥 𝑥 = 𝑧
4 elirrv 9566 . . . . . . . . 9 ¬ 𝑥𝑥
5 elequ1 2153 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥𝑥𝑧𝑥))
64, 5mtbii 329 . . . . . . . 8 (𝑥 = 𝑧 → ¬ 𝑧𝑥)
76sps 2224 . . . . . . 7 (∀𝑥 𝑥 = 𝑧 → ¬ 𝑧𝑥)
87pm2.21d 122 . . . . . 6 (∀𝑥 𝑥 = 𝑧 → (𝑧𝑥 → ¬ 𝑧𝑦))
93, 8alrimi 2252 . . . . 5 (∀𝑥 𝑥 = 𝑧 → ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))
109anim2i 629 . . . 4 ((𝑥𝑦 ∧ ∀𝑥 𝑥 = 𝑧) → (𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦)))
1110expcom 419 . . 3 (∀𝑥 𝑥 = 𝑧 → (𝑥𝑦 → (𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))
122, 11eximd 2255 . 2 (∀𝑥 𝑥 = 𝑧 → (∃𝑥 𝑥𝑦 → ∃𝑥(𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))
131, 12syl5 35 1 (∀𝑥 𝑥 = 𝑧 → (𝑥𝑦 → ∃𝑥(𝑥𝑦 ∧ ∀𝑧(𝑧𝑥 → ¬ 𝑧𝑦))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  wal 1568  wex 1812
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406  ax-sep 5259  ax-reg 9561
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817
This theorem is used by:  axregndlem2  10603  axregnd  10604
  Copyright terms: Public domain W3C validator