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

Theorem limomss 7823
Description: The class of natural numbers is a subclass of any (infinite) limit ordinal. Exercise 1 of [TakeutiZaring] p. 44. Remarkably, our proof does not require the Axiom of Infinity. (Contributed by NM, 30-Oct-2003.)
Assertion
Ref Expression
limomss (Lim 𝐴 → ω ⊆ 𝐴)

Proof of Theorem limomss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limord 6386 . 2 (Lim 𝐴 → Ord 𝐴)
2 ordeleqon 7737 . . 3 (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
3 elom 7821 . . . . . . . . . 10 (𝑥 ∈ ω ↔ (𝑥 ∈ On ∧ ∀𝑦(Lim 𝑦𝑥𝑦)))
43simprbi 497 . . . . . . . . 9 (𝑥 ∈ ω → ∀𝑦(Lim 𝑦𝑥𝑦))
5 limeq 6337 . . . . . . . . . . 11 (𝑦 = 𝐴 → (Lim 𝑦 ↔ Lim 𝐴))
6 eleq2 2826 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
75, 6imbi12d 344 . . . . . . . . . 10 (𝑦 = 𝐴 → ((Lim 𝑦𝑥𝑦) ↔ (Lim 𝐴𝑥𝐴)))
87spcgv 3552 . . . . . . . . 9 (𝐴 ∈ On → (∀𝑦(Lim 𝑦𝑥𝑦) → (Lim 𝐴𝑥𝐴)))
94, 8syl5 34 . . . . . . . 8 (𝐴 ∈ On → (𝑥 ∈ ω → (Lim 𝐴𝑥𝐴)))
109com23 86 . . . . . . 7 (𝐴 ∈ On → (Lim 𝐴 → (𝑥 ∈ ω → 𝑥𝐴)))
1110imp 406 . . . . . 6 ((𝐴 ∈ On ∧ Lim 𝐴) → (𝑥 ∈ ω → 𝑥𝐴))
1211ssrdv 3941 . . . . 5 ((𝐴 ∈ On ∧ Lim 𝐴) → ω ⊆ 𝐴)
1312ex 412 . . . 4 (𝐴 ∈ On → (Lim 𝐴 → ω ⊆ 𝐴))
14 omsson 7822 . . . . . 6 ω ⊆ On
15 sseq2 3962 . . . . . 6 (𝐴 = On → (ω ⊆ 𝐴 ↔ ω ⊆ On))
1614, 15mpbiri 258 . . . . 5 (𝐴 = On → ω ⊆ 𝐴)
1716a1d 25 . . . 4 (𝐴 = On → (Lim 𝐴 → ω ⊆ 𝐴))
1813, 17jaoi 858 . . 3 ((𝐴 ∈ On ∨ 𝐴 = On) → (Lim 𝐴 → ω ⊆ 𝐴))
192, 18sylbi 217 . 2 (Ord 𝐴 → (Lim 𝐴 → ω ⊆ 𝐴))
201, 19mpcom 38 1 (Lim 𝐴 → ω ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848  wal 1540   = wceq 1542  wcel 2114  wss 3903  Ord word 6324  Oncon0 6325  Lim wlim 6326  ωcom 7818
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-ext 2709  ax-sep 5243  ax-pr 5379
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-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-tr 5208  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-ord 6328  df-on 6329  df-lim 6330  df-om 7819
This theorem is referenced by:  limom  7834  rdg0  8362  frfnom  8376  frsuc  8378  r1fin  9697  rankdmr1  9725  rankeq0b  9784  cardlim  9896  ackbij2  10164  cfom  10186  wunom  10643  inar1  10698  bj-rdg0gALT  37316
  Copyright terms: Public domain W3C validator