Theorem onun2 6433

Description: The union of two ordinals is an ordinal. (Contributed by Scott Fenton, 9-Aug-2024.)

Assertion

Ref	Expression
onun2	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∪ 𝐵) ∈ On)

Proof of Theorem onun2

Step	Hyp	Ref	Expression
1		ssequn1 4126	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ 𝐵) = 𝐵)
2		eleq1a 2831	. . . 4 ⊢ (𝐵 ∈ On → ((𝐴 ∪ 𝐵) = 𝐵 → (𝐴 ∪ 𝐵) ∈ On))
3	2	adantl 481	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∪ 𝐵) = 𝐵 → (𝐴 ∪ 𝐵) ∈ On))
4	1, 3	biimtrid 242	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ∪ 𝐵) ∈ On))
5		ssequn2 4129	. . 3 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∪ 𝐵) = 𝐴)
6		eleq1a 2831	. . . 4 ⊢ (𝐴 ∈ On → ((𝐴 ∪ 𝐵) = 𝐴 → (𝐴 ∪ 𝐵) ∈ On))
7	6	adantr 480	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∪ 𝐵) = 𝐴 → (𝐴 ∪ 𝐵) ∈ On))
8	5, 7	biimtrid 242	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ⊆ 𝐴 → (𝐴 ∪ 𝐵) ∈ On))
9		eloni 6333	. . 3 ⊢ (𝐴 ∈ On → Ord 𝐴)
10		eloni 6333	. . 3 ⊢ (𝐵 ∈ On → Ord 𝐵)
11		ordtri2or2 6424	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
12	9, 10, 11	syl2an 597	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
13	4, 8, 12	mpjaod 861	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∪ 𝐵) ∈ On)

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ∪ cun 3887   ⊆ wss 3889  Ord word 6322  Oncon0 6323

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-tr 5193  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-ord 6326  df-on 6327

This theorem is referenced by:  onun2i  6446  nosupinfsep  27696  onexlimgt  43671  omabs2  43760  onsucunitp  43801