Metamath Proof Explorer


Theorem ordunmax

Description: The union of two ordinals is equal to their maximum. (Contributed by BTernaryTau, 7-Oct-2026)

Ref Expression
Assertion ordunmax ⊢ Ord ⁡ A ∧ Ord ⁡ B → A ∪ B = if A ⊆ B B A

Proof

Step Hyp Ref Expression
1 ordtri2or2 ⊢ Ord ⁡ A ∧ Ord ⁡ B → A ⊆ B ∨ B ⊆ A
2 1 ord ⊢ Ord ⁡ A ∧ Ord ⁡ B → ¬ A ⊆ B → B ⊆ A
3 ssequn2 ⊢ B ⊆ A ↔ A ∪ B = A
4 2 3 imbitrdi ⊢ Ord ⁡ A ∧ Ord ⁡ B → ¬ A ⊆ B → A ∪ B = A
5 iffalse ⊢ ¬ A ⊆ B → if A ⊆ B B A = A
6 4 5 jca2 ⊢ Ord ⁡ A ∧ Ord ⁡ B → ¬ A ⊆ B → A ∪ B = A ∧ if A ⊆ B B A = A
7 eqtr3 ⊢ A ∪ B = A ∧ if A ⊆ B B A = A → A ∪ B = if A ⊆ B B A
8 6 7 syl6 ⊢ Ord ⁡ A ∧ Ord ⁡ B → ¬ A ⊆ B → A ∪ B = if A ⊆ B B A
9 ssequn1 ⊢ A ⊆ B ↔ A ∪ B = B
10 9 biimpi ⊢ A ⊆ B → A ∪ B = B
11 iftrue ⊢ A ⊆ B → if A ⊆ B B A = B
12 10 11 eqtr4d ⊢ A ⊆ B → A ∪ B = if A ⊆ B B A
13 8 12 pm2.61d2 ⊢ Ord ⁡ A ∧ Ord ⁡ B → A ∪ B = if A ⊆ B B A