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

Theorem orduniss 6477
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 6391 . 2 (Ord 𝐴 → Tr 𝐴)
2 df-tr 5216 . 2 (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
31, 2sylib 221 1 (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ⊆ wss 3900  ∪ cuni 4870  Tr wtr 5215  Ord word 6376
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 5216  df-ord 6380
This theorem is used by:  orduniorsuc  7862  onfununi  8374  rankuniss  9907  r1limwun  10845  ontgval  37396  onsupneqmaxlim0  44416  onsupnmax  44420
  Copyright terms: Public domain W3C validator