| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > onsupcl2 | Structured version Visualization version GIF version | ||
| Description: The supremum of a set of ordinals is an ordinal. (Contributed by RP, 23-Jan-2025.) |
| Ref | Expression |
|---|---|
| onsupcl2 | ⊢ (𝐴 ∈ 𝒫 On → ∪ 𝐴 ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elpwb 4571 | . 2 ⊢ (𝐴 ∈ 𝒫 On ↔ (𝐴 ∈ V ∧ 𝐴 ⊆ On)) | |
| 2 | ssonuni 7756 | . . 3 ⊢ (𝐴 ∈ V → (𝐴 ⊆ On → ∪ 𝐴 ∈ On)) | |
| 3 | 2 | imp 406 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐴 ⊆ On) → ∪ 𝐴 ∈ On) |
| 4 | 1, 3 | sylbi 217 | 1 ⊢ (𝐴 ∈ 𝒫 On → ∪ 𝐴 ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2109 Vcvv 3447 ⊆ wss 3914 𝒫 cpw 4563 ∪ cuni 4871 Oncon0 6332 |
| 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 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |