| 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 4875 | . . . 4 ⊢ (𝑥 ∈ ∪ On ↔ ∃𝑦 ∈ On 𝑥 ∈ 𝑦) | |
| 2 | onelon 6357 | . . . . 5 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On) | |
| 3 | 2 | rexlimiva 3126 | . . . 4 ⊢ (∃𝑦 ∈ On 𝑥 ∈ 𝑦 → 𝑥 ∈ On) |
| 4 | 1, 3 | sylbi 217 | . . 3 ⊢ (𝑥 ∈ ∪ On → 𝑥 ∈ On) |
| 5 | vex 3451 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 6 | 5 | sucid 6416 | . . . 4 ⊢ 𝑥 ∈ suc 𝑥 |
| 7 | onsuc 7787 | . . . 4 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
| 8 | elunii 4876 | . . . 4 ⊢ ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ On) → 𝑥 ∈ ∪ On) | |
| 9 | 6, 7, 8 | sylancr 587 | . . 3 ⊢ (𝑥 ∈ On → 𝑥 ∈ ∪ On) |
| 10 | 4, 9 | impbii 209 | . 2 ⊢ (𝑥 ∈ ∪ On ↔ 𝑥 ∈ On) |
| 11 | 10 | eqriv 2726 | 1 ⊢ ∪ On = On |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 ∃wrex 3053 ∪ cuni 4871 Oncon0 6332 suc csuc 6334 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-tr 5215 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-ord 6335 df-on 6336 df-suc 6338 |
| This theorem is referenced by: ordunisuc 7807 limon 7811 orduninsuc 7819 ordtoplem 36423 ordcmp 36435 onsupnmax 43217 |
| Copyright terms: Public domain | W3C validator |