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

Theorem ordunisssuc 6456
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 3933 . . . . 5 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
2 ordsssuc 6439 . . . . 5 ((𝑥 ∈ On ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
31, 2sylan 589 . . . 4 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
43an32s 662 . . 3 (((𝐴 ⊆ On ∧ Ord 𝐵) ∧ 𝑥𝐴) → (𝑥𝐵𝑥 ∈ suc 𝐵))
54ralbidva 3185 . 2 ((𝐴 ⊆ On ∧ Ord 𝐵) → (∀𝑥𝐴 𝑥𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵))
6 unissb 4901 . 2 ( 𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)
7 dfss3 3927 . 2 (𝐴 ⊆ suc 𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵)
85, 6, 73bitr4g 316 1 ((𝐴 ⊆ On ∧ Ord 𝐵) → ( 𝐴𝐵𝐴 ⊆ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wcel 2144  wral 3078  wss 3906   cuni 4867  Ord word 6347  Oncon0 6348  suc csuc 6350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-tr 5210  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-ord 6351  df-on 6352  df-suc 6354
This theorem is referenced by:  ordsucuniel  7806  onsucuni  7810  isfinite2  9244  rankbnd2  9829  onintunirab  43809
  Copyright terms: Public domain W3C validator