Theorem oasuc 6710

Description: Addition with successor. Definition 8.1 of [TakeutiZaring] p. 56. (Contributed by NM, 3-May-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)

Assertion

Ref	Expression
oasuc	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))

Proof of Theorem oasuc

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		onsuc 4628	. . . . . 6 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On)
2		oav2 6709	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)))
3	1, 2	sylan2 286	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)))
4		df-suc 4497	. . . . . . . . . 10 ⊢ suc 𝐵 = (𝐵 ∪ {𝐵})
5		iuneq1 4009	. . . . . . . . . 10 ⊢ (suc 𝐵 = (𝐵 ∪ {𝐵}) → ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = ∪ 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥))
6	4, 5	ax-mp 5	. . . . . . . . 9 ⊢ ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = ∪ 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥)
7		iunxun 4076	. . . . . . . . 9 ⊢ ∪ 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥) = (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥))
8	6, 7	eqtri 2255	. . . . . . . 8 ⊢ ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥))
9		oveq2 6066	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵))
10		suceq 4528	. . . . . . . . . . 11 ⊢ ((𝐴 +o 𝑥) = (𝐴 +o 𝐵) → suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
11	9, 10	syl 14	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
12	11	iunxsng 4072	. . . . . . . . 9 ⊢ (𝐵 ∈ On → ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
13	12	uneq2d 3377	. . . . . . . 8 ⊢ (𝐵 ∈ On → (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥)) = (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
14	8, 13	eqtrid 2279	. . . . . . 7 ⊢ (𝐵 ∈ On → ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
15	14	uneq2d 3377	. . . . . 6 ⊢ (𝐵 ∈ On → (𝐴 ∪ ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)) = (𝐴 ∪ (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
16	15	adantl 277	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∪ ∪ 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)) = (𝐴 ∪ (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
17	3, 16	eqtrd 2267	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 ∪ (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
18		unass 3380	. . . 4 ⊢ ((𝐴 ∪ ∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)) = (𝐴 ∪ (∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
19	17, 18	eqtr4di 2285	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = ((𝐴 ∪ ∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)))
20		oav2 6709	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥)))
21	20	uneq1d 3376	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = ((𝐴 ∪ ∪ 𝑥 ∈ 𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)))
22	19, 21	eqtr4d 2270	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)))
23		sssucid 4541	. . 3 ⊢ (𝐴 +o 𝐵) ⊆ suc (𝐴 +o 𝐵)
24		ssequn1 3393	. . 3 ⊢ ((𝐴 +o 𝐵) ⊆ suc (𝐴 +o 𝐵) ↔ ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
25	23, 24	mpbi 145	. 2 ⊢ ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
26	22, 25	eqtrdi 2283	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2205   ∪ cun 3212   ⊆ wss 3214  {csn 3694  ∪ ciun 3996  Oncon0 4489  suc csuc 4491  (class class class)co 6058   +_o coa 6657

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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-oadd 6664

This theorem is referenced by:  onasuc  6712  nnaordi  6754