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

Theorem orduniss 6462
Description: An ordinal class includes its union. (Contributed by NM, 13-Sep-2003.)
Assertion
Ref Expression
orduniss (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴)

Proof of Theorem orduniss
StepHypRef Expression
1 ordtr 6376 . 2 (Ord 𝐴 → Tr 𝐴)
2 df-tr 5212 . 2 (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
31, 2sylib 221 1 (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ⊆ wss 3895  ∪ cuni 4866  Tr wtr 5211  Ord word 6361
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This proof depends on definitions:  df-bi 210  df-an 402  df-tr 5212  df-ord 6365
This theorem is used by:  orduniorsuc  7841  onfununi  8349  rankuniss  9883  r1limwun  10821  ontgval  37219  onsupneqmaxlim0  44226  onsupnmax  44230
  Copyright terms: Public domain W3C validator