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

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

Proof of Theorem axacndlem3
StepHypRef Expression
1 nfae 2398 . . . 4 𝑧𝑦 𝑦 = 𝑧
2 simpl 476 . . . . . 6 ((𝑦𝑧𝑧𝑤) → 𝑦𝑧)
32alimi 1855 . . . . 5 (∀𝑥(𝑦𝑧𝑧𝑤) → ∀𝑥 𝑦𝑧)
4 nd3 9748 . . . . . 6 (∀𝑦 𝑦 = 𝑧 → ¬ ∀𝑥 𝑦𝑧)
54pm2.21d 119 . . . . 5 (∀𝑦 𝑦 = 𝑧 → (∀𝑥 𝑦𝑧 → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
63, 5syl5 34 . . . 4 (∀𝑦 𝑦 = 𝑧 → (∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
71, 6alrimi 2199 . . 3 (∀𝑦 𝑦 = 𝑧 → ∀𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
87axc4i 2297 . 2 (∀𝑦 𝑦 = 𝑧 → ∀𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
9 19.8a 2166 . 2 (∀𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)) → ∃𝑥𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
108, 9syl 17 1 (∀𝑦 𝑦 = 𝑧 → ∃𝑥𝑦𝑧(∀𝑥(𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386  ∀wal 1599  ∃wex 1823 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5019  ax-nul 5027  ax-pr 5140  ax-reg 8788 This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ral 3095  df-rex 3096  df-v 3400  df-dif 3795  df-un 3797  df-nul 4142  df-sn 4399  df-pr 4401 This theorem is referenced by:  axacndlem5  9770  axacnd  9771
 Copyright terms: Public domain W3C validator