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

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

This theorem should not be referenced in any proof. Instead, use ax-inf2 9710 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 7927 . . 3 ∅ ∈ ω
2 peano2 7929 . . . 4 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
32ax-gen 1793 . . 3 𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)
4 zfinf 9708 . . . . . 6 𝑥(𝑦𝑥 ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑦𝑧𝑧𝑥)))
54inf2 9692 . . . . 5 𝑥(𝑥 ≠ ∅ ∧ 𝑥 𝑥)
65inf3 9704 . . . 4 ω ∈ V
7 eleq2 2833 . . . . 5 (𝑥 = ω → (∅ ∈ 𝑥 ↔ ∅ ∈ ω))
8 eleq2 2833 . . . . . . 7 (𝑥 = ω → (𝑦𝑥𝑦 ∈ ω))
9 eleq2 2833 . . . . . . 7 (𝑥 = ω → (suc 𝑦𝑥 ↔ suc 𝑦 ∈ ω))
108, 9imbi12d 344 . . . . . 6 (𝑥 = ω → ((𝑦𝑥 → suc 𝑦𝑥) ↔ (𝑦 ∈ ω → suc 𝑦 ∈ ω)))
1110albidv 1919 . . . . 5 (𝑥 = ω → (∀𝑦(𝑦𝑥 → suc 𝑦𝑥) ↔ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)))
127, 11anbi12d 631 . . . 4 (𝑥 = ω → ((∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ (∅ ∈ ω ∧ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω))))
136, 12spcev 3619 . . 3 ((∅ ∈ ω ∧ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)) → ∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)))
141, 3, 13mp2an 691 . 2 𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥))
15 0el 4386 . . . . 5 (∅ ∈ 𝑥 ↔ ∃𝑦𝑥𝑧 ¬ 𝑧𝑦)
16 df-rex 3077 . . . . 5 (∃𝑦𝑥𝑧 ¬ 𝑧𝑦 ↔ ∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦))
1715, 16bitri 275 . . . 4 (∅ ∈ 𝑥 ↔ ∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦))
18 sucel 6469 . . . . . . 7 (suc 𝑦𝑥 ↔ ∃𝑧𝑥𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))
19 df-rex 3077 . . . . . . 7 (∃𝑧𝑥𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)) ↔ ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2018, 19bitri 275 . . . . . 6 (suc 𝑦𝑥 ↔ ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2120imbi2i 336 . . . . 5 ((𝑦𝑥 → suc 𝑦𝑥) ↔ (𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2221albii 1817 . . . 4 (∀𝑦(𝑦𝑥 → suc 𝑦𝑥) ↔ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2317, 22anbi12i 627 . . 3 ((∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ (∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
2423exbii 1846 . 2 (∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ ∃𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
2514, 24mpbi 230 1 𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 846  wal 1535   = wceq 1537  wex 1777  wcel 2108  wrex 3076  c0 4352  suc csuc 6397  ωcom 7903
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-reg 9661  ax-inf 9707
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-om 7904  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator