Theorem onsucunipr 44140

Description: The successor to the union of any pair of ordinals is the union of the successors of the elements. (Contributed by RP, 12-Feb-2025.)

Assertion

Ref	Expression
onsucunipr	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc ∪ {𝐴, 𝐵} = ∪ {suc 𝐴, suc 𝐵})

Proof of Theorem onsucunipr

Step	Hyp	Ref	Expression
1		ssequn1 4142	. . . . . 6 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ 𝐵) = 𝐵)
2		suceq 6436	. . . . . 6 ⊢ ((𝐴 ∪ 𝐵) = 𝐵 → suc (𝐴 ∪ 𝐵) = suc 𝐵)
3	1, 2	sylbi 220	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → suc (𝐴 ∪ 𝐵) = suc 𝐵)
4	3	adantl 487	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → suc (𝐴 ∪ 𝐵) = suc 𝐵)
5		onsucwordi 44056	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → suc 𝐴 ⊆ suc 𝐵))
6	5	imp 412	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → suc 𝐴 ⊆ suc 𝐵)
7		ssequn1 4142	. . . . 5 ⊢ (suc 𝐴 ⊆ suc 𝐵 ↔ (suc 𝐴 ∪ suc 𝐵) = suc 𝐵)
8	6, 7	sylib 221	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (suc 𝐴 ∪ suc 𝐵) = suc 𝐵)
9	4, 8	eqtr4d 2804	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → suc (𝐴 ∪ 𝐵) = (suc 𝐴 ∪ suc 𝐵))
10		ssequn2 4145	. . . . . 6 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∪ 𝐵) = 𝐴)
11		suceq 6436	. . . . . 6 ⊢ ((𝐴 ∪ 𝐵) = 𝐴 → suc (𝐴 ∪ 𝐵) = suc 𝐴)
12	10, 11	sylbi 220	. . . . 5 ⊢ (𝐵 ⊆ 𝐴 → suc (𝐴 ∪ 𝐵) = suc 𝐴)
13	12	adantl 487	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵 ⊆ 𝐴) → suc (𝐴 ∪ 𝐵) = suc 𝐴)
14		onsucwordi 44056	. . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 → suc 𝐵 ⊆ suc 𝐴))
15	14	ancoms 464	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ⊆ 𝐴 → suc 𝐵 ⊆ suc 𝐴))
16	15	imp 412	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵 ⊆ 𝐴) → suc 𝐵 ⊆ suc 𝐴)
17		ssequn2 4145	. . . . 5 ⊢ (suc 𝐵 ⊆ suc 𝐴 ↔ (suc 𝐴 ∪ suc 𝐵) = suc 𝐴)
18	16, 17	sylib 221	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵 ⊆ 𝐴) → (suc 𝐴 ∪ suc 𝐵) = suc 𝐴)
19	13, 18	eqtr4d 2804	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵 ⊆ 𝐴) → suc (𝐴 ∪ 𝐵) = (suc 𝐴 ∪ suc 𝐵))
20		eloni 6377	. . . 4 ⊢ (𝐴 ∈ On → Ord 𝐴)
21		eloni 6377	. . . 4 ⊢ (𝐵 ∈ On → Ord 𝐵)
22		ordtri2or2 6469	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
23	20, 21, 22	syl2an 608	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
24	9, 19, 23	mpjaodan 973	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴 ∪ 𝐵) = (suc 𝐴 ∪ suc 𝐵))
25		uniprg 4893	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
26		suceq 6436	. . 3 ⊢ (∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵) → suc ∪ {𝐴, 𝐵} = suc (𝐴 ∪ 𝐵))
27	25, 26	syl 18	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc ∪ {𝐴, 𝐵} = suc (𝐴 ∪ 𝐵))
28		onsuc 7818	. . 3 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
29		onsuc 7818	. . 3 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On)
30		uniprg 4893	. . 3 ⊢ ((suc 𝐴 ∈ On ∧ suc 𝐵 ∈ On) → ∪ {suc 𝐴, suc 𝐵} = (suc 𝐴 ∪ suc 𝐵))
31	28, 29, 30	syl2an 608	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∪ {suc 𝐴, suc 𝐵} = (suc 𝐴 ∪ suc 𝐵))
32	24, 27, 31	3eqtr4d 2811	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc ∪ {𝐴, 𝐵} = ∪ {suc 𝐴, suc 𝐵})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2146   ∪ cun 3906   ⊆ wss 3908  {cpr 4596  ∪ cuni 4877  Ord word 6366  Oncon0 6367  suc csuc 6369

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-tr 5224  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-ord 6370  df-on 6371  df-suc 6373

This theorem is used by:  onsucunitp  44141