Theorem ordunpr 7766

Description: The maximum of two ordinals is equal to one of them. (Contributed by Mario Carneiro, 25-Jun-2015.)

Assertion

Ref	Expression
ordunpr	⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶})

Proof of Theorem ordunpr

Step	Hyp	Ref	Expression
1		eloni 6320	. . . . 5 ⊢ (𝐵 ∈ On → Ord 𝐵)
2		eloni 6320	. . . . 5 ⊢ (𝐶 ∈ On → Ord 𝐶)
3		ordtri2or2 6411	. . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵))
4	1, 2, 3	syl2an 602	. . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵))
5	4	orcomd 877	. . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐶))
6		ssequn2 4118	. . . 4 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∪ 𝐶) = 𝐵)
7		ssequn1 4115	. . . 4 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ∪ 𝐶) = 𝐶)
8	6, 7	orbi12i 920	. . 3 ⊢ ((𝐶 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐶) ↔ ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶))
9	5, 8	sylib 219	. 2 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶))
10		unexg 7686	. . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∪ 𝐶) ∈ V)
11		elprg 4578	. . 3 ⊢ ((𝐵 ∪ 𝐶) ∈ V → ((𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶} ↔ ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶)))
12	10, 11	syl 17	. 2 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶} ↔ ((𝐵 ∪ 𝐶) = 𝐵 ∨ (𝐵 ∪ 𝐶) = 𝐶)))
13	9, 12	mpbird 258	1 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∪ 𝐶) ∈ {𝐵, 𝐶})

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∨ wo 853   = wceq 1547   ∈ wcel 2119  Vcvv 3431   ∪ cun 3881   ⊆ wss 3883  {cpr 4557  Ord word 6309  Oncon0 6310

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-tr 5180  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-ord 6313  df-on 6314

This theorem is referenced by:  ordunel  7767  r0weon  9925