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

Theorem limomss 7845
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 6401 . 2 (Lim 𝐴 → Ord 𝐴)
2 ordeleqon 7759 . . 3 (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
3 elom 7843 . . . . . . . . . 10 (𝑥 ∈ ω ↔ (𝑥 ∈ On ∧ ∀𝑦(Lim 𝑦𝑥𝑦)))
43simprbi 501 . . . . . . . . 9 (𝑥 ∈ ω → ∀𝑦(Lim 𝑦𝑥𝑦))
5 limeq 6352 . . . . . . . . . . 11 (𝑦 = 𝐴 → (Lim 𝑦 ↔ Lim 𝐴))
6 eleq2 2850 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
75, 6imbi12d 346 . . . . . . . . . 10 (𝑦 = 𝐴 → ((Lim 𝑦𝑥𝑦) ↔ (Lim 𝐴𝑥𝐴)))
87spcgv 3554 . . . . . . . . 9 (𝐴 ∈ On → (∀𝑦(Lim 𝑦𝑥𝑦) → (Lim 𝐴𝑥𝐴)))
94, 8syl5 34 . . . . . . . 8 (𝐴 ∈ On → (𝑥 ∈ ω → (Lim 𝐴𝑥𝐴)))
109com23 86 . . . . . . 7 (𝐴 ∈ On → (Lim 𝐴 → (𝑥 ∈ ω → 𝑥𝐴)))
1110imp 410 . . . . . 6 ((𝐴 ∈ On ∧ Lim 𝐴) → (𝑥 ∈ ω → 𝑥𝐴))
1211ssrdv 3940 . . . . 5 ((𝐴 ∈ On ∧ Lim 𝐴) → ω ⊆ 𝐴)
1312ex 416 . . . 4 (𝐴 ∈ On → (Lim 𝐴 → ω ⊆ 𝐴))
14 omsson 7844 . . . . . 6 ω ⊆ On
15 sseq2 3960 . . . . . 6 (𝐴 = On → (ω ⊆ 𝐴 ↔ ω ⊆ On))
1614, 15mpbiri 260 . . . . 5 (𝐴 = On → ω ⊆ 𝐴)
1716a1d 25 . . . 4 (𝐴 = On → (Lim 𝐴 → ω ⊆ 𝐴))
1813, 17jaoi 868 . . 3 ((𝐴 ∈ On ∨ 𝐴 = On) → (Lim 𝐴 → ω ⊆ 𝐴))
192, 18sylbi 219 . 2 (Ord 𝐴 → (Lim 𝐴 → ω ⊆ 𝐴))
201, 19mpcom 38 1 (Lim 𝐴 → ω ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wo 858  wal 1557   = wceq 1559  wcel 2141  wss 3902  Ord word 6339  Oncon0 6340  Lim wlim 6341  ωcom 7840
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-tr 5205  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-ord 6343  df-on 6344  df-lim 6345  df-om 7841
This theorem is referenced by:  limom  7856  rdg0  8385  frfnom  8399  frsuc  8401  r1fin  9724  rankdmr1  9752  rankeq0b  9811  cardlim  9923  ackbij2  10191  cfom  10214  wunom  10671  inar1  10726  bj-rdg0gALT  37516
  Copyright terms: Public domain W3C validator