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

Theorem ordunisssuc 6470
Description: A subclass relationship for union and successor of ordinal classes. (Contributed by NM, 28-Nov-2003.)
Assertion
Ref Expression
ordunisssuc ((𝐴 ⊆ On ∧ Ord 𝐵) → ( 𝐴𝐵𝐴 ⊆ suc 𝐵))

Proof of Theorem ordunisssuc
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssel2 3938 . . . . 5 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
2 ordsssuc 6453 . . . . 5 ((𝑥 ∈ On ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
31, 2sylan 591 . . . 4 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
43an32s 664 . . 3 (((𝐴 ⊆ On ∧ Ord 𝐵) ∧ 𝑥𝐴) → (𝑥𝐵𝑥 ∈ suc 𝐵))
54ralbidva 3192 . 2 ((𝐴 ⊆ On ∧ Ord 𝐵) → (∀𝑥𝐴 𝑥𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵))
6 unissb 4908 . 2 ( 𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)
7 dfss3 3932 . 2 (𝐴 ⊆ suc 𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵)
85, 6, 73bitr4g 317 1 ((𝐴 ⊆ On ∧ Ord 𝐵) → ( 𝐴𝐵𝐴 ⊆ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wcel 2149  wral 3085  wss 3911   cuni 4874  Ord word 6360  Oncon0 6361  suc csuc 6363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5259  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3423  df-v 3463  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5112  df-opab 5176  df-tr 5221  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-ord 6364  df-on 6365  df-suc 6367
This theorem is referenced by:  ordsucuniel  7820  onsucuni  7824  isfinite2  9258  rankbnd2  9841  onintunirab  43881
  Copyright terms: Public domain W3C validator