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

Theorem zfcndinf 10684
Description: Axiom of Infinity ax-inf 9623, reproved from conditionless ZFC axioms. Since we have already reproved Extensionality, Replacement, and Power Sets above, we are justified in referencing Theorem el 5406 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 5406 . . 3 ∃𝑤 𝑥 ∈ 𝑤
2 nfv 1947 . . . . . 6 Ⅎ𝑤 𝑥 ∈ 𝑦
3 nfe1 2187 . . . . . . . 8 Ⅎ𝑤∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)
42, 3nfim 1929 . . . . . . 7 Ⅎ𝑤(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
54nfal 2354 . . . . . 6 Ⅎ𝑤∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
62, 5nfan 1932 . . . . 5 Ⅎ𝑤(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
76nfex 2355 . . . 4 Ⅎ𝑤∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
8 axinfnd 10672 . . . . 5 ∃𝑦(𝑥 ∈ 𝑤 → (𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
9819.37iv 1981 . . . 4 (𝑥 ∈ 𝑤 → ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
107, 9exlimi 2254 . . 3 (∃𝑤 𝑥 ∈ 𝑤 → ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
111, 10ax-mp 5 . 2 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
12 elequ1 2152 . . . . . 6 (𝑧 = 𝑥 → (𝑧 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
13 elequ1 2152 . . . . . . . 8 (𝑧 = 𝑥 → (𝑧 ∈ 𝑤 ↔ 𝑥 ∈ 𝑤))
1413anbi1d 643 . . . . . . 7 (𝑧 = 𝑥 → ((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) ↔ (𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1514exbidv 1954 . . . . . 6 (𝑧 = 𝑥 → (∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) ↔ ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)))
1612, 15imbi12d 347 . . . . 5 (𝑧 = 𝑥 → ((𝑧 ∈ 𝑦 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦)) ↔ (𝑥 ∈ 𝑦 → ∃𝑤(𝑥 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))))
1716cbvalvw 2069 . . . 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 2145
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-reg 9570  ax-inf 9623
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 2100  df-cleq 2753  df-clel 2836  df-nfc 2910
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator