| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > orduniss | Structured version Visualization version GIF version | ||
| Description: An ordinal class includes its union. (Contributed by NM, 13-Sep-2003.) |
| Ref | Expression |
|---|---|
| orduniss | ⊢ (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordtr 6365 | . 2 ⊢ (Ord 𝐴 → Tr 𝐴) | |
| 2 | df-tr 5212 | . 2 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴) | |
| 3 | 1, 2 | sylib 221 | 1 ⊢ (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3898 ∪ cuni 4866 Tr wtr 5211 Ord word 6350 |
| 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 6354 |
| This theorem is used by: orduniorsuc 7824 onfununi 8327 rankuniss 9856 r1limwun 10792 ontgval 37141 onsupneqmaxlim0 44169 onsupnmax 44173 |
| Copyright terms: Public domain | W3C validator |