Theorem onsucuni2 7826

Description: A successor ordinal is the successor of its union. (Contributed by NM, 10-Dec-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
onsucuni2	⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = 𝐴)

Proof of Theorem onsucuni2

Step	Hyp	Ref	Expression
1		eleq1 2820	. . . . . 6 ⊢ (𝐴 = suc 𝐵 → (𝐴 ∈ On ↔ suc 𝐵 ∈ On))
2	1	biimpac 478	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc 𝐵 ∈ On)
3		eloni 6374	. . . . 5 ⊢ (suc 𝐵 ∈ On → Ord suc 𝐵)
4		ordsuc 7805	. . . . . . . 8 ⊢ (Ord 𝐵 ↔ Ord suc 𝐵)
5		ordunisuc 7824	. . . . . . . 8 ⊢ (Ord 𝐵 → ∪ suc 𝐵 = 𝐵)
6	4, 5	sylbir 234	. . . . . . 7 ⊢ (Ord suc 𝐵 → ∪ suc 𝐵 = 𝐵)
7		suceq 6430	. . . . . . 7 ⊢ (∪ suc 𝐵 = 𝐵 → suc ∪ suc 𝐵 = suc 𝐵)
8	6, 7	syl 17	. . . . . 6 ⊢ (Ord suc 𝐵 → suc ∪ suc 𝐵 = suc 𝐵)
9		ordunisuc 7824	. . . . . 6 ⊢ (Ord suc 𝐵 → ∪ suc suc 𝐵 = suc 𝐵)
10	8, 9	eqtr4d 2774	. . . . 5 ⊢ (Ord suc 𝐵 → suc ∪ suc 𝐵 = ∪ suc suc 𝐵)
11	2, 3, 10	3syl 18	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ suc 𝐵 = ∪ suc suc 𝐵)
12		unieq 4919	. . . . . 6 ⊢ (𝐴 = suc 𝐵 → ∪ 𝐴 = ∪ suc 𝐵)
13		suceq 6430	. . . . . 6 ⊢ (∪ 𝐴 = ∪ suc 𝐵 → suc ∪ 𝐴 = suc ∪ suc 𝐵)
14	12, 13	syl 17	. . . . 5 ⊢ (𝐴 = suc 𝐵 → suc ∪ 𝐴 = suc ∪ suc 𝐵)
15		suceq 6430	. . . . . 6 ⊢ (𝐴 = suc 𝐵 → suc 𝐴 = suc suc 𝐵)
16	15	unieqd 4922	. . . . 5 ⊢ (𝐴 = suc 𝐵 → ∪ suc 𝐴 = ∪ suc suc 𝐵)
17	14, 16	eqeq12d 2747	. . . 4 ⊢ (𝐴 = suc 𝐵 → (suc ∪ 𝐴 = ∪ suc 𝐴 ↔ suc ∪ suc 𝐵 = ∪ suc suc 𝐵))
18	11, 17	imbitrrid 245	. . 3 ⊢ (𝐴 = suc 𝐵 → ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = ∪ suc 𝐴))
19	18	anabsi7 668	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = ∪ suc 𝐴)
20		eloni 6374	. . . 4 ⊢ (𝐴 ∈ On → Ord 𝐴)
21		ordunisuc 7824	. . . 4 ⊢ (Ord 𝐴 → ∪ suc 𝐴 = 𝐴)
22	20, 21	syl 17	. . 3 ⊢ (𝐴 ∈ On → ∪ suc 𝐴 = 𝐴)
23	22	adantr 480	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → ∪ suc 𝐴 = 𝐴)
24	19, 23	eqtrd 2771	1 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2105  ∪ cuni 4908  Ord word 6363  Oncon0 6364  suc csuc 6366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7729

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6367  df-on 6368  df-suc 6370

This theorem is referenced by:  rankxplim3  9880  rankxpsuc  9881  onsucf1lem  42322