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 3929 . . . . 5 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
2 ordsssuc 6453 . . . . 5 ((𝑥 ∈ On ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
31, 2sylan 592 . . . 4 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
43an32s 665 . . 3 (((𝐴 ⊆ On ∧ Ord 𝐵) ∧ 𝑥𝐴) → (𝑥𝐵𝑥 ∈ suc 𝐵))
54ralbidva 3185 . 2 ((𝐴 ⊆ On ∧ Ord 𝐵) → (∀𝑥𝐴 𝑥𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵))
6 unissb 4904 . 2 ( 𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)
7 dfss3 3923 . 2 (𝐴 ⊆ suc 𝐵 ↔ ∀𝑥𝐴 𝑥 ∈ suc 𝐵)
85, 6, 73bitr4g 317 1 ((𝐴 ⊆ On ∧ Ord 𝐵) → ( 𝐴𝐵𝐴 ⊆ suc 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wcel 2145  wral 3078  wss 3902   cuni 4870  Ord word 6360  Oncon0 6361  suc csuc 6363
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 2734  ax-sep 5255  ax-pr 5402
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 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-ord 6364  df-on 6365  df-suc 6367
This theorem is used by:  ordsucuniel  7823  onsucuni  7827  isfinite2  9271  rankbnd2  9854  onintunirab  44055
  Copyright terms: Public domain W3C validator