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

Theorem zfcndinf 10706
Description: Axiom of Infinity ax-inf 9642, reproved from conditionless ZFC axioms. Since we have already reproved Extensionality, Replacement, and Power Sets above, we are justified in referencing Theorem el 5405 in the proof. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by NM, 15-Aug-2003.)
Assertion
Ref Expression
zfcndinf ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
Distinct variable group:   𝑥,𝑦,𝑧,𝑤

Proof of Theorem zfcndinf
StepHypRef Expression
1 el 5405 . . 3 ∃𝑤 𝑥 ∈ 𝑤
2 nfv 1946 . . . . . 6 Ⅎ𝑤 𝑥 ∈ 𝑦
3 nfe1 2186 . . . . . . . 8 Ⅎ𝑤∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)
42, 3nfim 1928 . . . . . . 7 Ⅎ𝑤(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
54nfal 2353 . . . . . 6 Ⅎ𝑤∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
62, 5nfan 1931 . . . . 5 Ⅎ𝑤(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
76nfex 2354 . . . 4 Ⅎ𝑤∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
8 axinfnd 10694 . . . . 5 ∃𝑦(𝑥 ∈ 𝑤 → (𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
9819.37iv 1980 . . . 4 (𝑥 ∈ 𝑤 → ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
107, 9exlimi 2253 . . 3 (∃𝑤 𝑥 ∈ 𝑤 → ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
111, 10ax-mp 5 . 2 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
12 elequ1 2151 . . . . . 6 (𝑧 = 𝑥 → (𝑧 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
13 elequ1 2151 . . . . . . . 8 (𝑧 = 𝑥 → (𝑧 ∈ 𝑤 ↔ 𝑥 ∈ 𝑤))
1413anbi1d 643 . . . . . . 7 (𝑧 = 𝑥 → ((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) ↔ (𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1514exbidv 1953 . . . . . 6 (𝑧 = 𝑥 → (∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) ↔ ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1612, 15imbi12d 347 . . . . 5 (𝑧 = 𝑥 → ((𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)) ↔ (𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
1716cbvalvw 2068 . . . 4 (∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)) ↔ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1817anbi2i 635 . . 3 ((𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))) ↔ (𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
1918exbii 1880 . 2 (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
2011, 19mpbir 234 1 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401  ax-ext 2732  ax-sep 5248  ax-pr 5390  ax-reg 9589  ax-inf 9642
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-cleq 2752  df-clel 2835  df-nfc 2909
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator