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

Theorem axinf2 9552
Description: A standard version of Axiom of Infinity, expanded to primitives, derived from our version of Infinity ax-inf 9550 and Regularity ax-reg 9500.

This theorem should not be referenced in any proof. Instead, use ax-inf2 9553 below so that the ordinary uses of Regularity can be more easily identified. (New usage is discouraged.) (Contributed by NM, 3-Nov-1996.)

Assertion
Ref Expression
axinf2 𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
Distinct variable group:   𝑥,𝑦,𝑧,𝑤

Proof of Theorem axinf2
StepHypRef Expression
1 peano1 7833 . . 3 ∅ ∈ ω
2 peano2 7834 . . . 4 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
32ax-gen 1797 . . 3 𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)
4 zfinf 9551 . . . . . 6 𝑥(𝑦𝑥 ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑦𝑧𝑧𝑥)))
54inf2 9535 . . . . 5 𝑥(𝑥 ≠ ∅ ∧ 𝑥 𝑥)
65inf3 9547 . . . 4 ω ∈ V
7 eleq2 2826 . . . . 5 (𝑥 = ω → (∅ ∈ 𝑥 ↔ ∅ ∈ ω))
8 eleq2 2826 . . . . . . 7 (𝑥 = ω → (𝑦𝑥𝑦 ∈ ω))
9 eleq2 2826 . . . . . . 7 (𝑥 = ω → (suc 𝑦𝑥 ↔ suc 𝑦 ∈ ω))
108, 9imbi12d 344 . . . . . 6 (𝑥 = ω → ((𝑦𝑥 → suc 𝑦𝑥) ↔ (𝑦 ∈ ω → suc 𝑦 ∈ ω)))
1110albidv 1922 . . . . 5 (𝑥 = ω → (∀𝑦(𝑦𝑥 → suc 𝑦𝑥) ↔ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)))
127, 11anbi12d 633 . . . 4 (𝑥 = ω → ((∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ (∅ ∈ ω ∧ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω))))
136, 12spcev 3549 . . 3 ((∅ ∈ ω ∧ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)) → ∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)))
141, 3, 13mp2an 693 . 2 𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥))
15 0el 4304 . . . . 5 (∅ ∈ 𝑥 ↔ ∃𝑦𝑥𝑧 ¬ 𝑧𝑦)
16 df-rex 3063 . . . . 5 (∃𝑦𝑥𝑧 ¬ 𝑧𝑦 ↔ ∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦))
1715, 16bitri 275 . . . 4 (∅ ∈ 𝑥 ↔ ∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦))
18 sucel 6393 . . . . . . 7 (suc 𝑦𝑥 ↔ ∃𝑧𝑥𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))
19 df-rex 3063 . . . . . . 7 (∃𝑧𝑥𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)) ↔ ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2018, 19bitri 275 . . . . . 6 (suc 𝑦𝑥 ↔ ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2120imbi2i 336 . . . . 5 ((𝑦𝑥 → suc 𝑦𝑥) ↔ (𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2221albii 1821 . . . 4 (∀𝑦(𝑦𝑥 → suc 𝑦𝑥) ↔ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2317, 22anbi12i 629 . . 3 ((∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ (∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
2423exbii 1850 . 2 (∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ ∃𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
2514, 24mpbi 230 1 𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848  wal 1540   = wceq 1542  wex 1781  wcel 2114  wrex 3062  c0 4274  suc csuc 6319  ωcom 7810
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-reg 9500  ax-inf 9550
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-om 7811  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator