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

Theorem oasuc 6522
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 4537 . . . . . 6 (𝐵 ∈ On → suc 𝐵 ∈ On)
2 oav2 6521 . . . . . 6 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)))
31, 2sylan2 286 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)))
4 df-suc 4406 . . . . . . . . . 10 suc 𝐵 = (𝐵 ∪ {𝐵})
5 iuneq1 3929 . . . . . . . . . 10 (suc 𝐵 = (𝐵 ∪ {𝐵}) → 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥))
64, 5ax-mp 5 . . . . . . . . 9 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥)
7 iunxun 3996 . . . . . . . . 9 𝑥 ∈ (𝐵 ∪ {𝐵})suc (𝐴 +o 𝑥) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥))
86, 7eqtri 2217 . . . . . . . 8 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥))
9 oveq2 5930 . . . . . . . . . . 11 (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵))
10 suceq 4437 . . . . . . . . . . 11 ((𝐴 +o 𝑥) = (𝐴 +o 𝐵) → suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
119, 10syl 14 . . . . . . . . . 10 (𝑥 = 𝐵 → suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
1211iunxsng 3992 . . . . . . . . 9 (𝐵 ∈ On → 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥) = suc (𝐴 +o 𝐵))
1312uneq2d 3317 . . . . . . . 8 (𝐵 ∈ On → ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ 𝑥 ∈ {𝐵}suc (𝐴 +o 𝑥)) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
148, 13eqtrid 2241 . . . . . . 7 (𝐵 ∈ On → 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥) = ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
1514uneq2d 3317 . . . . . 6 (𝐵 ∈ On → (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
1615adantl 277 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 𝑥 ∈ suc 𝐵 suc (𝐴 +o 𝑥)) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
173, 16eqtrd 2229 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵))))
18 unass 3320 . . . 4 ((𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)) = (𝐴 ∪ ( 𝑥𝐵 suc (𝐴 +o 𝑥) ∪ suc (𝐴 +o 𝐵)))
1917, 18eqtr4di 2247 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = ((𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)))
20 oav2 6521 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)))
2120uneq1d 3316 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = ((𝐴 𝑥𝐵 suc (𝐴 +o 𝑥)) ∪ suc (𝐴 +o 𝐵)))
2219, 21eqtr4d 2232 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)))
23 sssucid 4450 . . 3 (𝐴 +o 𝐵) ⊆ suc (𝐴 +o 𝐵)
24 ssequn1 3333 . . 3 ((𝐴 +o 𝐵) ⊆ suc (𝐴 +o 𝐵) ↔ ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
2523, 24mpbi 145 . 2 ((𝐴 +o 𝐵) ∪ suc (𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
2622, 25eqtrdi 2245 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2167  cun 3155  wss 3157  {csn 3622   ciun 3916  Oncon0 4398  suc csuc 4400  (class class class)co 5922   +o coa 6471
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-suc 4406  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-irdg 6428  df-oadd 6478
This theorem is referenced by:  onasuc  6524  nnaordi  6566
  Copyright terms: Public domain W3C validator