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

Theorem ordunisssuc 6424
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 3927 . . . . 5 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
2 ordsssuc 6407 . . . . 5 ((𝑥 ∈ On ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
31, 2sylan 581 . . . 4 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
43an32s 653 . . 3 (((𝐴 ⊆ On ∧ Ord 𝐵) ∧ 𝑥𝐴) → (𝑥𝐵𝑥 ∈ suc 𝐵))
54ralbidva 3156 . 2 ((𝐴 ⊆ On ∧ Ord 𝐵) → (∀𝑥𝐴 𝑥𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵))
6 unissb 4895 . 2 ( 𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)
7 dfss3 3921 . 2 (𝐴 ⊆ suc 𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵)
85, 6, 73bitr4g 314 1 ((𝐴 ⊆ On ∧ Ord 𝐵) → ( 𝐴𝐵𝐴 ⊆ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2114  wral 3050  wss 3900   cuni 4862  Ord word 6315  Oncon0 6316  suc csuc 6318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-tr 5205  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-ord 6319  df-on 6320  df-suc 6322
This theorem is referenced by:  ordsucuniel  7766  onsucuni  7770  isfinite2  9200  rankbnd2  9783  onintunirab  43506
  Copyright terms: Public domain W3C validator