![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > orduniss2 | Structured version Visualization version GIF version |
Description: The union of the ordinal subsets of an ordinal number is that number. (Contributed by NM, 30-Jan-2005.) |
Ref | Expression |
---|---|
orduniss2 | ⊢ (Ord 𝐴 → ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rab 3429 | . . . . 5 ⊢ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ⊆ 𝐴)} | |
2 | incom 4201 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ∈ On} ∩ {𝑥 ∣ 𝑥 ⊆ 𝐴}) = ({𝑥 ∣ 𝑥 ⊆ 𝐴} ∩ {𝑥 ∣ 𝑥 ∈ On}) | |
3 | inab 4300 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ∈ On} ∩ {𝑥 ∣ 𝑥 ⊆ 𝐴}) = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ⊆ 𝐴)} | |
4 | df-pw 4606 | . . . . . . . 8 ⊢ 𝒫 𝐴 = {𝑥 ∣ 𝑥 ⊆ 𝐴} | |
5 | 4 | eqcomi 2736 | . . . . . . 7 ⊢ {𝑥 ∣ 𝑥 ⊆ 𝐴} = 𝒫 𝐴 |
6 | abid2 2866 | . . . . . . 7 ⊢ {𝑥 ∣ 𝑥 ∈ On} = On | |
7 | 5, 6 | ineq12i 4210 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ⊆ 𝐴} ∩ {𝑥 ∣ 𝑥 ∈ On}) = (𝒫 𝐴 ∩ On) |
8 | 2, 3, 7 | 3eqtr3i 2763 | . . . . 5 ⊢ {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ⊆ 𝐴)} = (𝒫 𝐴 ∩ On) |
9 | 1, 8 | eqtri 2755 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = (𝒫 𝐴 ∩ On) |
10 | ordpwsuc 7822 | . . . 4 ⊢ (Ord 𝐴 → (𝒫 𝐴 ∩ On) = suc 𝐴) | |
11 | 9, 10 | eqtrid 2779 | . . 3 ⊢ (Ord 𝐴 → {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = suc 𝐴) |
12 | 11 | unieqd 4923 | . 2 ⊢ (Ord 𝐴 → ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = ∪ suc 𝐴) |
13 | ordunisuc 7839 | . 2 ⊢ (Ord 𝐴 → ∪ suc 𝐴 = 𝐴) | |
14 | 12, 13 | eqtrd 2767 | 1 ⊢ (Ord 𝐴 → ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 {cab 2704 {crab 3428 ∩ cin 3946 ⊆ wss 3947 𝒫 cpw 4604 ∪ cuni 4910 Ord word 6371 Oncon0 6372 suc csuc 6374 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2698 ax-sep 5301 ax-nul 5308 ax-pr 5431 ax-un 7744 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2705 df-cleq 2719 df-clel 2805 df-ne 2937 df-ral 3058 df-rex 3067 df-rab 3429 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-br 5151 df-opab 5213 df-tr 5268 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-we 5637 df-ord 6375 df-on 6376 df-suc 6378 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |