Users' Mathboxes Mathbox for Eric Schmidt < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  omssaxinf2 Structured version   Visualization version   GIF version

Theorem omssaxinf2 45811
Description: A class that contains all ordinals up to and including ω models the Axiom of Infinity ax-inf2 9620. The antecedent of this theorem is not enough to guarantee that the class models the alternate axiom ax-inf 9617. (Contributed by Eric Schmidt, 19-Oct-2025.)
Assertion
Ref Expression
omssaxinf2 ((ω ⊆ 𝑀 ∧ ω ∈ 𝑀) → ∃𝑥𝑀 (∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤   𝑥,𝑀,𝑦,𝑧
Allowed substitution hint:   𝑀(𝑤)

Proof of Theorem omssaxinf2
StepHypRef Expression
1 peano1 7885 . . . . 5 ∅ ∈ ω
2 ssel 3925 . . . . 5 (ω ⊆ 𝑀 → (∅ ∈ ω → ∅ ∈ 𝑀))
31, 2mpi 21 . . . 4 (ω ⊆ 𝑀 → ∅ ∈ 𝑀)
4 noel 4284 . . . . . 6 ¬ 𝑧 ∈ ∅
54rgenw 3080 . . . . 5 𝑧𝑀 ¬ 𝑧 ∈ ∅
6 eleq1 2848 . . . . . . 7 (𝑦 = ∅ → (𝑦 ∈ ω ↔ ∅ ∈ ω))
7 eleq2 2849 . . . . . . . . 9 (𝑦 = ∅ → (𝑧𝑦𝑧 ∈ ∅))
87notbid 321 . . . . . . . 8 (𝑦 = ∅ → (¬ 𝑧𝑦 ↔ ¬ 𝑧 ∈ ∅))
98ralbidv 3185 . . . . . . 7 (𝑦 = ∅ → (∀𝑧𝑀 ¬ 𝑧𝑦 ↔ ∀𝑧𝑀 ¬ 𝑧 ∈ ∅))
106, 9anbi12d 644 . . . . . 6 (𝑦 = ∅ → ((𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ↔ (∅ ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧 ∈ ∅)))
1110rspcev 3576 . . . . 5 ((∅ ∈ 𝑀 ∧ (∅ ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧 ∈ ∅)) → ∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦))
121, 5, 11mpanr12 718 . . . 4 (∅ ∈ 𝑀 → ∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦))
133, 12syl 18 . . 3 (ω ⊆ 𝑀 → ∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦))
14 ssel 3925 . . . . . . 7 (ω ⊆ 𝑀 → (suc 𝑦 ∈ ω → suc 𝑦𝑀))
15 peano2 7886 . . . . . . 7 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
1614, 15impel 515 . . . . . 6 ((ω ⊆ 𝑀𝑦 ∈ ω) → suc 𝑦𝑀)
1715adantl 487 . . . . . 6 ((ω ⊆ 𝑀𝑦 ∈ ω) → suc 𝑦 ∈ ω)
18 vex 3454 . . . . . . . . 9 𝑤 ∈ V
1918elsuc 6430 . . . . . . . 8 (𝑤 ∈ suc 𝑦 ↔ (𝑤𝑦𝑤 = 𝑦))
2019rgenw 3080 . . . . . . 7 𝑤𝑀 (𝑤 ∈ suc 𝑦 ↔ (𝑤𝑦𝑤 = 𝑦))
21 eleq1 2848 . . . . . . . . 9 (𝑧 = suc 𝑦 → (𝑧 ∈ ω ↔ suc 𝑦 ∈ ω))
22 eleq2 2849 . . . . . . . . . . 11 (𝑧 = suc 𝑦 → (𝑤𝑧𝑤 ∈ suc 𝑦))
2322bibi1d 346 . . . . . . . . . 10 (𝑧 = suc 𝑦 → ((𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)) ↔ (𝑤 ∈ suc 𝑦 ↔ (𝑤𝑦𝑤 = 𝑦))))
2423ralbidv 3185 . . . . . . . . 9 (𝑧 = suc 𝑦 → (∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)) ↔ ∀𝑤𝑀 (𝑤 ∈ suc 𝑦 ↔ (𝑤𝑦𝑤 = 𝑦))))
2521, 24anbi12d 644 . . . . . . . 8 (𝑧 = suc 𝑦 → ((𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))) ↔ (suc 𝑦 ∈ ω ∧ ∀𝑤𝑀 (𝑤 ∈ suc 𝑦 ↔ (𝑤𝑦𝑤 = 𝑦)))))
2625rspcev 3576 . . . . . . 7 ((suc 𝑦𝑀 ∧ (suc 𝑦 ∈ ω ∧ ∀𝑤𝑀 (𝑤 ∈ suc 𝑦 ↔ (𝑤𝑦𝑤 = 𝑦)))) → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2720, 26mpanr2 717 . . . . . 6 ((suc 𝑦𝑀 ∧ suc 𝑦 ∈ ω) → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2816, 17, 27syl2anc 596 . . . . 5 ((ω ⊆ 𝑀𝑦 ∈ ω) → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))
2928ex 418 . . . 4 (ω ⊆ 𝑀 → (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
3029ralrimivw 3158 . . 3 (ω ⊆ 𝑀 → ∀𝑦𝑀 (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
31 eleq2 2849 . . . . . . . 8 (𝑥 = ω → (𝑦𝑥𝑦 ∈ ω))
3231anbi1d 643 . . . . . . 7 (𝑥 = ω → ((𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ↔ (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦)))
3332rexbidv 3186 . . . . . 6 (𝑥 = ω → (∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ↔ ∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦)))
34 eleq2 2849 . . . . . . . . . 10 (𝑥 = ω → (𝑧𝑥𝑧 ∈ ω))
3534anbi1d 643 . . . . . . . . 9 (𝑥 = ω → ((𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))) ↔ (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
3635rexbidv 3186 . . . . . . . 8 (𝑥 = ω → (∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))) ↔ ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))
3731, 36imbi12d 347 . . . . . . 7 (𝑥 = ω → ((𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))) ↔ (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
3837ralbidv 3185 . . . . . 6 (𝑥 = ω → (∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))) ↔ ∀𝑦𝑀 (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
3933, 38anbi12d 644 . . . . 5 (𝑥 = ω → ((∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))) ↔ (∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))))
4039rspcev 3576 . . . 4 ((ω ∈ 𝑀 ∧ (∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))) → ∃𝑥𝑀 (∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
4140expcom 419 . . 3 ((∃𝑦𝑀 (𝑦 ∈ ω ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦 ∈ ω → ∃𝑧𝑀 (𝑧 ∈ ω ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))) → (ω ∈ 𝑀 → ∃𝑥𝑀 (∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))))
4213, 30, 41syl2anc 596 . 2 (ω ⊆ 𝑀 → (ω ∈ 𝑀 → ∃𝑥𝑀 (∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦)))))))
4342imp 412 1 ((ω ⊆ 𝑀 ∧ ω ∈ 𝑀) → ∃𝑥𝑀 (∃𝑦𝑀 (𝑦𝑥 ∧ ∀𝑧𝑀 ¬ 𝑧𝑦) ∧ ∀𝑦𝑀 (𝑦𝑥 → ∃𝑧𝑀 (𝑧𝑥 ∧ ∀𝑤𝑀 (𝑤𝑧 ↔ (𝑤𝑦𝑤 = 𝑦))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wo 861   = wceq 1570  wcel 2145  wral 3076  wrex 3086  wss 3899  c0 4279  suc csuc 6359  ωcom 7862
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-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736
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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-om 7863
This theorem is used by:  omelaxinf2  45812
  Copyright terms: Public domain W3C validator