Theorem onsucuni2 4565

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 2240	. . . . . 6 ⊢ (𝐴 = suc 𝐵 → (𝐴 ∈ On ↔ suc 𝐵 ∈ On))
2	1	biimpac 298	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc 𝐵 ∈ On)
3		onsucb 4504	. . . . . . 7 ⊢ (𝐵 ∈ On ↔ suc 𝐵 ∈ On)
4		eloni 4377	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → Ord 𝐵)
5		ordtr 4380	. . . . . . . . . 10 ⊢ (Ord 𝐵 → Tr 𝐵)
6	4, 5	syl 14	. . . . . . . . 9 ⊢ (𝐵 ∈ On → Tr 𝐵)
7		unisucg 4416	. . . . . . . . 9 ⊢ (𝐵 ∈ On → (Tr 𝐵 ↔ ∪ suc 𝐵 = 𝐵))
8	6, 7	mpbid 147	. . . . . . . 8 ⊢ (𝐵 ∈ On → ∪ suc 𝐵 = 𝐵)
9		suceq 4404	. . . . . . . 8 ⊢ (∪ suc 𝐵 = 𝐵 → suc ∪ suc 𝐵 = suc 𝐵)
10	8, 9	syl 14	. . . . . . 7 ⊢ (𝐵 ∈ On → suc ∪ suc 𝐵 = suc 𝐵)
11	3, 10	sylbir 135	. . . . . 6 ⊢ (suc 𝐵 ∈ On → suc ∪ suc 𝐵 = suc 𝐵)
12		eloni 4377	. . . . . . . 8 ⊢ (suc 𝐵 ∈ On → Ord suc 𝐵)
13		ordtr 4380	. . . . . . . 8 ⊢ (Ord suc 𝐵 → Tr suc 𝐵)
14	12, 13	syl 14	. . . . . . 7 ⊢ (suc 𝐵 ∈ On → Tr suc 𝐵)
15		unisucg 4416	. . . . . . 7 ⊢ (suc 𝐵 ∈ On → (Tr suc 𝐵 ↔ ∪ suc suc 𝐵 = suc 𝐵))
16	14, 15	mpbid 147	. . . . . 6 ⊢ (suc 𝐵 ∈ On → ∪ suc suc 𝐵 = suc 𝐵)
17	11, 16	eqtr4d 2213	. . . . 5 ⊢ (suc 𝐵 ∈ On → suc ∪ suc 𝐵 = ∪ suc suc 𝐵)
18	2, 17	syl 14	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ suc 𝐵 = ∪ suc suc 𝐵)
19		unieq 3820	. . . . . 6 ⊢ (𝐴 = suc 𝐵 → ∪ 𝐴 = ∪ suc 𝐵)
20		suceq 4404	. . . . . 6 ⊢ (∪ 𝐴 = ∪ suc 𝐵 → suc ∪ 𝐴 = suc ∪ suc 𝐵)
21	19, 20	syl 14	. . . . 5 ⊢ (𝐴 = suc 𝐵 → suc ∪ 𝐴 = suc ∪ suc 𝐵)
22		suceq 4404	. . . . . 6 ⊢ (𝐴 = suc 𝐵 → suc 𝐴 = suc suc 𝐵)
23	22	unieqd 3822	. . . . 5 ⊢ (𝐴 = suc 𝐵 → ∪ suc 𝐴 = ∪ suc suc 𝐵)
24	21, 23	eqeq12d 2192	. . . 4 ⊢ (𝐴 = suc 𝐵 → (suc ∪ 𝐴 = ∪ suc 𝐴 ↔ suc ∪ suc 𝐵 = ∪ suc suc 𝐵))
25	18, 24	imbitrrid 156	. . 3 ⊢ (𝐴 = suc 𝐵 → ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = ∪ suc 𝐴))
26	25	anabsi7 581	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = ∪ suc 𝐴)
27		eloni 4377	. . . . 5 ⊢ (𝐴 ∈ On → Ord 𝐴)
28		ordtr 4380	. . . . 5 ⊢ (Ord 𝐴 → Tr 𝐴)
29	27, 28	syl 14	. . . 4 ⊢ (𝐴 ∈ On → Tr 𝐴)
30		unisucg 4416	. . . 4 ⊢ (𝐴 ∈ On → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))
31	29, 30	mpbid 147	. . 3 ⊢ (𝐴 ∈ On → ∪ suc 𝐴 = 𝐴)
32	31	adantr 276	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → ∪ suc 𝐴 = 𝐴)
33	26, 32	eqtrd 2210	1 ⊢ ((𝐴 ∈ On ∧ 𝐴 = suc 𝐵) → suc ∪ 𝐴 = 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148  ∪ cuni 3811  Tr wtr 4103  Ord word 4364  Oncon0 4365  suc csuc 4367

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-uni 3812  df-tr 4104  df-iord 4368  df-on 4370  df-suc 4373

This theorem is referenced by:  nnsucpred  4618  nnpredcl  4624