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

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

This theorem should not be referenced in any proof. Instead, use ax-inf2 9624 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 7889 . . 3 ∅ ∈ ω
2 peano2 7890 . . . 4 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
32ax-gen 1828 . . 3 𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)
4 zfinf 9622 . . . . . 6 𝑥(𝑦𝑥 ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑦𝑧𝑧𝑥)))
54inf2 9606 . . . . 5 𝑥(𝑥 ≠ ∅ ∧ 𝑥 𝑥)
65inf3 9618 . . . 4 ω ∈ V
7 eleq2 2851 . . . . 5 (𝑥 = ω → (∅ ∈ 𝑥 ↔ ∅ ∈ ω))
8 eleq2 2851 . . . . . . 7 (𝑥 = ω → (𝑦𝑥𝑦 ∈ ω))
9 eleq2 2851 . . . . . . 7 (𝑥 = ω → (suc 𝑦𝑥 ↔ suc 𝑦 ∈ ω))
108, 9imbi12d 347 . . . . . 6 (𝑥 = ω → ((𝑦𝑥 → suc 𝑦𝑥) ↔ (𝑦 ∈ ω → suc 𝑦 ∈ ω)))
1110albidv 1953 . . . . 5 (𝑥 = ω → (∀𝑦(𝑦𝑥 → suc 𝑦𝑥) ↔ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)))
127, 11anbi12d 644 . . . 4 (𝑥 = ω → ((∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ (∅ ∈ ω ∧ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω))))
136, 12spcev 3563 . . 3 ((∅ ∈ ω ∧ ∀𝑦(𝑦 ∈ ω → suc 𝑦 ∈ ω)) → ∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)))
141, 3, 13mp2an 705 . 2 𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥))
15 0el 4314 . . . . 5 (∅ ∈ 𝑥 ↔ ∃𝑦𝑥𝑧 ¬ 𝑧𝑦)
16 df-rex 3089 . . . . 5 (∃𝑦𝑥𝑧 ¬ 𝑧𝑦 ↔ ∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦))
1715, 16bitri 278 . . . 4 (∅ ∈ 𝑥 ↔ ∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦))
18 sucel 6438 . . . . . . 7 (suc 𝑦𝑥 ↔ ∃𝑧𝑥𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))
19 df-rex 3089 . . . . . . 7 (∃𝑧𝑥𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)) ↔ ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2018, 19bitri 278 . . . . . 6 (suc 𝑦𝑥 ↔ ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2120imbi2i 339 . . . . 5 ((𝑦𝑥 → suc 𝑦𝑥) ↔ (𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2221albii 1852 . . . 4 (∀𝑦(𝑦𝑥 → suc 𝑦𝑥) ↔ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2317, 22anbi12i 640 . . 3 ((∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ (∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
2423exbii 1881 . 2 (∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦(𝑦𝑥 → suc 𝑦𝑥)) ↔ ∃𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
2514, 24mpbi 233 1 𝑥(∃𝑦(𝑦𝑥 ∧ ∀𝑧 ¬ 𝑧𝑦) ∧ ∀𝑦(𝑦𝑥 → ∃𝑧(𝑧𝑥 ∧ ∀𝑤(𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wo 861  wal 1568   = wceq 1570  wex 1812  wcel 2145  wrex 3088  c0 4282  suc csuc 6363  ωcom 7866
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-reg 9568  ax-inf 9621
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-om 7867  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator