| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unon | Structured version Visualization version GIF version | ||
| Description: The class of all ordinal numbers is its own union. Exercise 11 of [TakeutiZaring] p. 40. (Contributed by NM, 12-Nov-2003.) |
| Ref | Expression |
|---|---|
| unon | ⊢ ∪ On = On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluni2 4868 | . . . 4 ⊢ (𝑥 ∈ ∪ On ↔ ∃𝑦 ∈ On 𝑥 ∈ 𝑦) | |
| 2 | onelon 6343 | . . . . 5 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On) | |
| 3 | 2 | rexlimiva 3130 | . . . 4 ⊢ (∃𝑦 ∈ On 𝑥 ∈ 𝑦 → 𝑥 ∈ On) |
| 4 | 1, 3 | sylbi 217 | . . 3 ⊢ (𝑥 ∈ ∪ On → 𝑥 ∈ On) |
| 5 | vex 3445 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 6 | 5 | sucid 6402 | . . . 4 ⊢ 𝑥 ∈ suc 𝑥 |
| 7 | onsuc 7757 | . . . 4 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
| 8 | elunii 4869 | . . . 4 ⊢ ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 ∈ ∪ On) | |
| 9 | 6, 7, 8 | sylancr 588 | . . 3 ⊢ (𝑥 ∈ On → 𝑥 ∈ ∪ On) |
| 10 | 4, 9 | impbii 209 | . 2 ⊢ (𝑥 ∈ ∪ On ↔ 𝑥 ∈ On) |
| 11 | 10 | eqriv 2734 | 1 ⊢ ∪ On = On |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 ∃wrex 3061 ∪ cuni 4864 Oncon0 6318 suc csuc 6320 |
| 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 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 ax-un 7682 |
| 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 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-tr 5207 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-ord 6321 df-on 6322 df-suc 6324 |
| This theorem is referenced by: ordunisuc 7776 limon 7780 orduninsuc 7787 ordtoplem 36610 ordcmp 36622 onsupnmax 43506 |
| Copyright terms: Public domain | W3C validator |