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

Theorem limomss 7880
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 6423 . 2 (Lim 𝐴 → Ord 𝐴)
2 ordeleqon 7794 . . 3 (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
3 elom 7878 . . . . . . . . . 10 (𝑥 ∈ ω ↔ (𝑥 ∈ On ∧ ∀𝑦(Lim 𝑦 → 𝑥 ∈ 𝑦)))
43simprbi 503 . . . . . . . . 9 (𝑥 ∈ ω → ∀𝑦(Lim 𝑦 → 𝑥 ∈ 𝑦))
5 limeq 6373 . . . . . . . . . . 11 (𝑦 = 𝐴 → (Lim 𝑦 ↔ Lim 𝐴))
6 eleq2 2850 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝐴))
75, 6imbi12d 347 . . . . . . . . . 10 (𝑦 = 𝐴 → ((Lim 𝑦 → 𝑥 ∈ 𝑦) ↔ (Lim 𝐴 → 𝑥 ∈ 𝐴)))
87spcgv 3551 . . . . . . . . 9 (𝐴 ∈ On → (∀𝑦(Lim 𝑦 → 𝑥 ∈ 𝑦) → (Lim 𝐴 → 𝑥 ∈ 𝐴)))
94, 8syl5 35 . . . . . . . 8 (𝐴 ∈ On → (𝑥 ∈ ω → (Lim 𝐴 → 𝑥 ∈ 𝐴)))
109com23 87 . . . . . . 7 (𝐴 ∈ On → (Lim 𝐴 → (𝑥 ∈ ω → 𝑥 ∈ 𝐴)))
1110imp 412 . . . . . 6 ((𝐴 ∈ On ∧ Lim 𝐴) → (𝑥 ∈ ω → 𝑥 ∈ 𝐴))
1211ssrdv 3937 . . . . 5 ((𝐴 ∈ On ∧ Lim 𝐴) → ω ⊆ 𝐴)
1312ex 418 . . . 4 (𝐴 ∈ On → (Lim 𝐴 → ω ⊆ 𝐴))
14 omsson 7879 . . . . . 6 ω ⊆ On
15 sseq2 3957 . . . . . 6 (𝐴 = On → (ω ⊆ 𝐴 ↔ ω ⊆ On))
1614, 15mpbiri 261 . . . . 5 (𝐴 = On → ω ⊆ 𝐴)
1716a1d 26 . . . 4 (𝐴 = On → (Lim 𝐴 → ω ⊆ 𝐴))
1813, 17jaoi 871 . . 3 ((𝐴 ∈ On ∨ 𝐴 = On) → (Lim 𝐴 → ω ⊆ 𝐴))
192, 18sylbi 220 . 2 (Ord 𝐴 → (Lim 𝐴 → ω ⊆ 𝐴))
201, 19mpcom 39 1 (Lim 𝐴 → ω ⊆ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  Ord word 6360  Oncon0 6361  Lim wlim 6362  ωcom 7875
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 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6364  df-on 6365  df-lim 6366  df-om 7876
This theorem is used by:  limom  7891  rdg0  8422  frfnom  8436  frsuc  8438  r1fin  9773  rankdmr1  9802  rankeq0b  9869  cardlim  10046  ackbij2  10313  cfom  10335  wunom  10798  inar1  10853  bj-rdg0gALT  37966
  Copyright terms: Public domain W3C validator