![]() |
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 4916 | . . . 4 ⊢ (𝑥 ∈ ∪ On ↔ ∃𝑦 ∈ On 𝑥 ∈ 𝑦) | |
2 | onelon 6411 | . . . . 5 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ On) | |
3 | 2 | rexlimiva 3145 | . . . 4 ⊢ (∃𝑦 ∈ On 𝑥 ∈ 𝑦 → 𝑥 ∈ On) |
4 | 1, 3 | sylbi 217 | . . 3 ⊢ (𝑥 ∈ ∪ On → 𝑥 ∈ On) |
5 | vex 3482 | . . . . 5 ⊢ 𝑥 ∈ V | |
6 | 5 | sucid 6468 | . . . 4 ⊢ 𝑥 ∈ suc 𝑥 |
7 | onsuc 7831 | . . . 4 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
8 | elunii 4917 | . . . 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 2732 | 1 ⊢ ∪ On = On |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2106 ∃wrex 3068 ∪ cuni 4912 Oncon0 6386 suc csuc 6388 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-tr 5266 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-ord 6389 df-on 6390 df-suc 6392 |
This theorem is referenced by: ordunisuc 7852 limon 7856 orduninsuc 7864 ordtoplem 36418 ordcmp 36430 onsupnmax 43217 |
Copyright terms: Public domain | W3C validator |