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

Theorem limsssuc 7894
Description: A class includes a limit ordinal iff the successor of the class includes it. (Contributed by NM, 30-Oct-2003.)
Assertion
Ref Expression
limsssuc (Lim 𝐴 → (𝐴 ⊆ 𝐵 ↔ 𝐴 ⊆ suc 𝐵))

Proof of Theorem limsssuc
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 sssucid 6470 . . 3 𝐵 ⊆ suc 𝐵
2 sstr2 3919 . . 3 (𝐴 ⊆ 𝐵 → (𝐵 ⊆ suc 𝐵 → 𝐴 ⊆ suc 𝐵))
31, 2mpi 21 . 2 (𝐴 ⊆ 𝐵 → 𝐴 ⊆ suc 𝐵)
4 eleq1 2855 . . . . . . . . . . . 12 (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
54biimpcd 252 . . . . . . . . . . 11 (𝑥 ∈ 𝐴 → (𝑥 = 𝐵 → 𝐵 ∈ 𝐴))
6 limsuc 7893 . . . . . . . . . . . . . 14 (Lim 𝐴 → (𝐵 ∈ 𝐴 ↔ suc 𝐵 ∈ 𝐴))
76biimpa 482 . . . . . . . . . . . . 13 ((Lim 𝐴 ∧ 𝐵 ∈ 𝐴) → suc 𝐵 ∈ 𝐴)
8 limord 6449 . . . . . . . . . . . . . . 15 (Lim 𝐴 → Ord 𝐴)
9 ordelord 6409 . . . . . . . . . . . . . . . . 17 ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵)
108, 9sylan 592 . . . . . . . . . . . . . . . 16 ((Lim 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵)
11 ordsuc 7858 . . . . . . . . . . . . . . . 16 (Ord 𝐵 ↔ Ord suc 𝐵)
1210, 11sylib 221 . . . . . . . . . . . . . . 15 ((Lim 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord suc 𝐵)
13 ordtri1 6421 . . . . . . . . . . . . . . 15 ((Ord 𝐴 ∧ Ord suc 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ ¬ suc 𝐵 ∈ 𝐴))
148, 12, 13syl2an2r 698 . . . . . . . . . . . . . 14 ((Lim 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐴 ⊆ suc 𝐵 ↔ ¬ suc 𝐵 ∈ 𝐴))
1514con2bid 357 . . . . . . . . . . . . 13 ((Lim 𝐴 ∧ 𝐵 ∈ 𝐴) → (suc 𝐵 ∈ 𝐴 ↔ ¬ 𝐴 ⊆ suc 𝐵))
167, 15mpbid 235 . . . . . . . . . . . 12 ((Lim 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐴 ⊆ suc 𝐵)
1716ex 418 . . . . . . . . . . 11 (Lim 𝐴 → (𝐵 ∈ 𝐴 → ¬ 𝐴 ⊆ suc 𝐵))
185, 17sylan9r 518 . . . . . . . . . 10 ((Lim 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥 = 𝐵 → ¬ 𝐴 ⊆ suc 𝐵))
1918con2d 135 . . . . . . . . 9 ((Lim 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐴 ⊆ suc 𝐵 → ¬ 𝑥 = 𝐵))
2019ex 418 . . . . . . . 8 (Lim 𝐴 → (𝑥 ∈ 𝐴 → (𝐴 ⊆ suc 𝐵 → ¬ 𝑥 = 𝐵)))
2120com23 87 . . . . . . 7 (Lim 𝐴 → (𝐴 ⊆ suc 𝐵 → (𝑥 ∈ 𝐴 → ¬ 𝑥 = 𝐵)))
2221imp31 423 . . . . . 6 (((Lim 𝐴 ∧ 𝐴 ⊆ suc 𝐵) ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥 = 𝐵)
23 ssel2 3907 . . . . . . . . . 10 ((𝐴 ⊆ suc 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ suc 𝐵)
24 vex 3457 . . . . . . . . . . 11 𝑥 ∈ V
2524elsuc 6460 . . . . . . . . . 10 (𝑥 ∈ suc 𝐵 ↔ (𝑥 ∈ 𝐵 ∨ 𝑥 = 𝐵))
2623, 25sylib 221 . . . . . . . . 9 ((𝐴 ⊆ suc 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐵 ∨ 𝑥 = 𝐵))
2726ord 878 . . . . . . . 8 ((𝐴 ⊆ suc 𝐵 ∧ 𝑥 ∈ 𝐴) → (¬ 𝑥 ∈ 𝐵 → 𝑥 = 𝐵))
2827con1d 146 . . . . . . 7 ((𝐴 ⊆ suc 𝐵 ∧ 𝑥 ∈ 𝐴) → (¬ 𝑥 = 𝐵 → 𝑥 ∈ 𝐵))
2928adantll 727 . . . . . 6 (((Lim 𝐴 ∧ 𝐴 ⊆ suc 𝐵) ∧ 𝑥 ∈ 𝐴) → (¬ 𝑥 = 𝐵 → 𝑥 ∈ 𝐵))
3022, 29mpd 16 . . . . 5 (((Lim 𝐴 ∧ 𝐴 ⊆ suc 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
3130ex 418 . . . 4 ((Lim 𝐴 ∧ 𝐴 ⊆ suc 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
3231ssrdv 3918 . . 3 ((Lim 𝐴 ∧ 𝐴 ⊆ suc 𝐵) → 𝐴 ⊆ 𝐵)
3332ex 418 . 2 (Lim 𝐴 → (𝐴 ⊆ suc 𝐵 → 𝐴 ⊆ 𝐵))
343, 33impbid2 229 1 (Lim 𝐴 → (𝐴 ⊆ 𝐵 ↔ 𝐴 ⊆ suc 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1572   ∈ wcel 2150   ⊆ wss 3899  Ord word 6386  Lim wlim 6388  suc csuc 6389
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-tr 5218  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393
This theorem is used by:  cardlim  10089
  Copyright terms: Public domain W3C validator