Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordunpr | Structured version Visualization version GIF version |
Description: The maximum of two ordinals is equal to one of them. (Contributed by Mario Carneiro, 25-Jun-2015.) |
Ref | Expression |
---|---|
ordunpr | ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eloni 6276 | . . . . 5 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
2 | eloni 6276 | . . . . 5 ⊢ (𝐶 ∈ On → Ord 𝐶) | |
3 | ordtri2or2 6362 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵)) | |
4 | 1, 2, 3 | syl2an 596 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵)) |
5 | 4 | orcomd 868 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐶)) |
6 | ssequn2 4117 | . . . 4 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∪ 𝐶) = 𝐵) | |
7 | ssequn1 4114 | . . . 4 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ∪ 𝐶) = 𝐶) | |
8 | 6, 7 | orbi12i 912 | . . 3 ⊢ ((𝐶 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐶) ↔ ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶)) |
9 | 5, 8 | sylib 217 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶)) |
10 | unexg 7599 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∪ 𝐶) ∈ V) | |
11 | elprg 4582 | . . 3 ⊢ ((𝐵 ∪ 𝐶) ∈ V → ((𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶} ↔ ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶))) | |
12 | 10, 11 | syl 17 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶} ↔ ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶))) |
13 | 9, 12 | mpbird 256 | 1 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 844 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∪ cun 3885 ⊆ wss 3887 {cpr 4563 Ord word 6265 Oncon0 6266 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-tr 5192 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-ord 6269 df-on 6270 |
This theorem is referenced by: ordunel 7674 r0weon 9768 |
Copyright terms: Public domain | W3C validator |