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

Theorem axacndlem1 9373
Description: Lemma for the Axiom of Choice with no distinct variable conditions. (Contributed by NM, 3-Jan-2002.)
Assertion
Ref Expression
axacndlem1 (∀𝑥 𝑥 = 𝑦 → ∃𝑥𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))

Proof of Theorem axacndlem1
StepHypRef Expression
1 nfae 2315 . . 3 𝑦𝑥 𝑥 = 𝑦
2 nfae 2315 . . . 4 𝑧𝑥 𝑥 = 𝑦
3 simpl 473 . . . . . 6 ((𝑦𝑧𝑧𝑤) → 𝑦𝑧)
43alimi 1736 . . . . 5 (∀𝑥(𝑦𝑧𝑧𝑤) → ∀𝑥 𝑦𝑧)
5 nd1 9353 . . . . . 6 (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑦𝑧)
65pm2.21d 118 . . . . 5 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑦𝑧 → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
74, 6syl5 34 . . . 4 (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
82, 7alrimi 2080 . . 3 (∀𝑥 𝑥 = 𝑦 → ∀𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
91, 8alrimi 2080 . 2 (∀𝑥 𝑥 = 𝑦 → ∀𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
10 19.8a 2049 . 2 (∀𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)) → ∃𝑥𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
119, 10syl 17 1 (∀𝑥 𝑥 = 𝑦 → ∃𝑥𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wal 1478  wex 1701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867  ax-reg 8441
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-v 3188  df-dif 3558  df-un 3560  df-nul 3892  df-sn 4149  df-pr 4151
This theorem is referenced by:  axacndlem4  9376  axacndlem5  9377
  Copyright terms: Public domain W3C validator