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

Theorem limomss 7217
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 5927 . 2 (Lim 𝐴 → Ord 𝐴)
2 ordeleqon 7135 . . 3 (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
3 elom 7215 . . . . . . . . . 10 (𝑥 ∈ ω ↔ (𝑥 ∈ On ∧ ∀𝑦(Lim 𝑦𝑥𝑦)))
43simprbi 484 . . . . . . . . 9 (𝑥 ∈ ω → ∀𝑦(Lim 𝑦𝑥𝑦))
5 limeq 5878 . . . . . . . . . . 11 (𝑦 = 𝐴 → (Lim 𝑦 ↔ Lim 𝐴))
6 eleq2 2839 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
75, 6imbi12d 333 . . . . . . . . . 10 (𝑦 = 𝐴 → ((Lim 𝑦𝑥𝑦) ↔ (Lim 𝐴𝑥𝐴)))
87spcgv 3444 . . . . . . . . 9 (𝐴 ∈ On → (∀𝑦(Lim 𝑦𝑥𝑦) → (Lim 𝐴𝑥𝐴)))
94, 8syl5 34 . . . . . . . 8 (𝐴 ∈ On → (𝑥 ∈ ω → (Lim 𝐴𝑥𝐴)))
109com23 86 . . . . . . 7 (𝐴 ∈ On → (Lim 𝐴 → (𝑥 ∈ ω → 𝑥𝐴)))
1110imp 393 . . . . . 6 ((𝐴 ∈ On ∧ Lim 𝐴) → (𝑥 ∈ ω → 𝑥𝐴))
1211ssrdv 3758 . . . . 5 ((𝐴 ∈ On ∧ Lim 𝐴) → ω ⊆ 𝐴)
1312ex 397 . . . 4 (𝐴 ∈ On → (Lim 𝐴 → ω ⊆ 𝐴))
14 omsson 7216 . . . . . 6 ω ⊆ On
15 sseq2 3776 . . . . . 6 (𝐴 = On → (ω ⊆ 𝐴 ↔ ω ⊆ On))
1614, 15mpbiri 248 . . . . 5 (𝐴 = On → ω ⊆ 𝐴)
1716a1d 25 . . . 4 (𝐴 = On → (Lim 𝐴 → ω ⊆ 𝐴))
1813, 17jaoi 844 . . 3 ((𝐴 ∈ On ∨ 𝐴 = On) → (Lim 𝐴 → ω ⊆ 𝐴))
192, 18sylbi 207 . 2 (Ord 𝐴 → (Lim 𝐴 → ω ⊆ 𝐴))
201, 19mpcom 38 1 (Lim 𝐴 → ω ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  wo 834  wal 1629   = wceq 1631  wcel 2145  wss 3723  Ord word 5865  Oncon0 5866  Lim wlim 5867  ωcom 7212
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034  ax-un 7096
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3or 1072  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-tp 4321  df-op 4323  df-uni 4575  df-br 4787  df-opab 4847  df-tr 4887  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-om 7213
This theorem is referenced by:  limom  7227  rdg0  7670  frfnom  7683  frsuc  7685  r1fin  8800  rankdmr1  8828  rankeq0b  8887  cardlim  8998  ackbij2  9267  cfom  9288  wunom  9744  inar1  9799
  Copyright terms: Public domain W3C validator