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

Theorem limomss 7717
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 6325 . 2 (Lim 𝐴 → Ord 𝐴)
2 ordeleqon 7632 . . 3 (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
3 elom 7715 . . . . . . . . . 10 (𝑥 ∈ ω ↔ (𝑥 ∈ On ∧ ∀𝑦(Lim 𝑦𝑥𝑦)))
43simprbi 497 . . . . . . . . 9 (𝑥 ∈ ω → ∀𝑦(Lim 𝑦𝑥𝑦))
5 limeq 6278 . . . . . . . . . . 11 (𝑦 = 𝐴 → (Lim 𝑦 ↔ Lim 𝐴))
6 eleq2 2827 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
75, 6imbi12d 345 . . . . . . . . . 10 (𝑦 = 𝐴 → ((Lim 𝑦𝑥𝑦) ↔ (Lim 𝐴𝑥𝐴)))
87spcgv 3535 . . . . . . . . 9 (𝐴 ∈ On → (∀𝑦(Lim 𝑦𝑥𝑦) → (Lim 𝐴𝑥𝐴)))
94, 8syl5 34 . . . . . . . 8 (𝐴 ∈ On → (𝑥 ∈ ω → (Lim 𝐴𝑥𝐴)))
109com23 86 . . . . . . 7 (𝐴 ∈ On → (Lim 𝐴 → (𝑥 ∈ ω → 𝑥𝐴)))
1110imp 407 . . . . . 6 ((𝐴 ∈ On ∧ Lim 𝐴) → (𝑥 ∈ ω → 𝑥𝐴))
1211ssrdv 3927 . . . . 5 ((𝐴 ∈ On ∧ Lim 𝐴) → ω ⊆ 𝐴)
1312ex 413 . . . 4 (𝐴 ∈ On → (Lim 𝐴 → ω ⊆ 𝐴))
14 omsson 7716 . . . . . 6 ω ⊆ On
15 sseq2 3947 . . . . . 6 (𝐴 = On → (ω ⊆ 𝐴 ↔ ω ⊆ On))
1614, 15mpbiri 257 . . . . 5 (𝐴 = On → ω ⊆ 𝐴)
1716a1d 25 . . . 4 (𝐴 = On → (Lim 𝐴 → ω ⊆ 𝐴))
1813, 17jaoi 854 . . 3 ((𝐴 ∈ On ∨ 𝐴 = On) → (Lim 𝐴 → ω ⊆ 𝐴))
192, 18sylbi 216 . 2 (Ord 𝐴 → (Lim 𝐴 → ω ⊆ 𝐴))
201, 19mpcom 38 1 (Lim 𝐴 → ω ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 844  wal 1537   = wceq 1539  wcel 2106  wss 3887  Ord word 6265  Oncon0 6266  Lim wlim 6267  ωcom 7712
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-11 2154  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-tr 5192  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-ord 6269  df-on 6270  df-lim 6271  df-om 7713
This theorem is referenced by:  limom  7728  rdg0  8252  frfnom  8266  frsuc  8268  r1fin  9531  rankdmr1  9559  rankeq0b  9618  cardlim  9730  ackbij2  9999  cfom  10020  wunom  10476  inar1  10531  bj-rdg0gALT  35242
  Copyright terms: Public domain W3C validator