ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oasuc GIF version

Theorem oasuc 6627
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.
StepHypRef Expression
1 onsuc 4597 . . . . . 6 (𝐵 ∈ On → suc 𝐵 ∈ On)
2 oav2 6626 . . . . . 6 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)))
31, 2sylan2 286 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)))
4 df-suc 4466 . . . . . . . . . 10 suc 𝐵 = (𝐵 ∪ {𝐵})
5 iuneq1 3981 . . . . . . . . . 10 (suc 𝐵 = (𝐵 ∪ {𝐵}) → 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥))
64, 5ax-mp 5 . . . . . . . . 9 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥)
7 iunxun 4048 . . . . . . . . 9 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥))
86, 7eqtri 2250 . . . . . . . 8 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥))
9 oveq2 6021 . . . . . . . . . . 11 (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵))
10 suceq 4497 . . . . . . . . . . 11 ((𝐴 +o 𝑥) = (𝐴 +o 𝐵) → suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
119, 10syl 14 . . . . . . . . . 10 (𝑥 = 𝐵 → suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
1211iunxsng 4044 . . . . . . . . 9 (𝐵 ∈ On → 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
1312uneq2d 3359 . . . . . . . 8 (𝐵 ∈ On → ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥)) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
148, 13eqtrid 2274 . . . . . . 7 (𝐵 ∈ On → 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
1514uneq2d 3359 . . . . . 6 (𝐵 ∈ On → (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
1615adantl 277 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
173, 16eqtrd 2262 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
18 unass 3362 . . . 4 ((𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
1917, 18eqtr4di 2280 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = ((𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)))
20 oav2 6626 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)))
2120uneq1d 3358 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = ((𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)))
2219, 21eqtr4d 2265 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)))
23 sssucid 4510 . . 3 (𝐴 +o 𝐵) ⊆ suc (𝐴 +o 𝐵)
24 ssequn1 3375 . . 3 ((𝐴 +o 𝐵) ⊆ suc (𝐴 +o 𝐵) ↔ ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
2523, 24mpbi 145 . 2 ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
2622, 25eqtrdi 2278 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  cun 3196  wss 3198  {csn 3667   ciun 3968  Oncon0 4458  suc csuc 4460  (class class class)co 6013   +o coa 6574
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-oadd 6581
This theorem is referenced by:  onasuc  6629  nnaordi  6671
  Copyright terms: Public domain W3C validator