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

Theorem zfcndinf 10730
Description: Axiom of Infinity ax-inf 9666, reproved from conditionless ZFC axioms. Since we have already reproved Extensionality, Replacement, and Power Sets above, we are justified in referencing Theorem el 5410 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 5410 . . 3 ∃𝑤 𝑥 ∈ 𝑤
2 nfv 1949 . . . . . 6 Ⅎ𝑤 𝑥 ∈ 𝑦
3 nfe1 2190 . . . . . . . 8 Ⅎ𝑤∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)
42, 3nfim 1931 . . . . . . 7 Ⅎ𝑤(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
54nfal 2357 . . . . . 6 Ⅎ𝑤∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
62, 5nfan 1934 . . . . 5 Ⅎ𝑤(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
76nfex 2358 . . . 4 Ⅎ𝑤∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
8 axinfnd 10718 . . . . 5 ∃𝑦(𝑥 ∈ 𝑤 → (𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
9819.37iv 1983 . . . 4 (𝑥 ∈ 𝑤 → ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
107, 9exlimi 2257 . . 3 (∃𝑤 𝑥 ∈ 𝑤 → ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
111, 10ax-mp 5 . 2 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
12 elequ1 2154 . . . . . 6 (𝑧 = 𝑥 → (𝑧 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
13 elequ1 2154 . . . . . . . 8 (𝑧 = 𝑥 → (𝑧 ∈ 𝑤 ↔ 𝑥 ∈ 𝑤))
1413anbi1d 643 . . . . . . 7 (𝑧 = 𝑥 → ((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) ↔ (𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1514exbidv 1956 . . . . . 6 (𝑧 = 𝑥 → (∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) ↔ ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1612, 15imbi12d 347 . . . . 5 (𝑧 = 𝑥 → ((𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)) ↔ (𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
1716cbvalvw 2071 . . . 4 (∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)) ↔ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1817anbi2i 635 . . 3 ((𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))) ↔ (𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
1918exbii 1881 . 2 (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
2011, 19mpbir 234 1 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404  ax-ext 2735  ax-sep 5252  ax-pr 5395  ax-reg 9613  ax-inf 9666
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-cleq 2755  df-clel 2839  df-nfc 2913
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator