![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oasuc | Structured version Visualization version GIF version |
Description: Addition with successor. Definition 8.1 of [TakeutiZaring] p. 56. Definition 2.3 of [Schloeder] p. 4. (Contributed by NM, 3-May-1995.) (Revised by Mario Carneiro, 8-Sep-2013.) |
Ref | Expression |
---|---|
oasuc | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rdgsuc 8430 | . . 3 ⊢ (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))) | |
2 | 1 | adantl 481 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))) |
3 | onsuc 7803 | . . 3 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On) | |
4 | oav 8517 | . . 3 ⊢ ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵)) | |
5 | 3, 4 | sylan2 592 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵)) |
6 | ovex 7445 | . . . 4 ⊢ (𝐴 +o 𝐵) ∈ V | |
7 | suceq 6430 | . . . . 5 ⊢ (𝑥 = (𝐴 +o 𝐵) → suc 𝑥 = suc (𝐴 +o 𝐵)) | |
8 | eqid 2731 | . . . . 5 ⊢ (𝑥 ∈ V ↦ suc 𝑥) = (𝑥 ∈ V ↦ suc 𝑥) | |
9 | 6 | sucex 7798 | . . . . 5 ⊢ suc (𝐴 +o 𝐵) ∈ V |
10 | 7, 8, 9 | fvmpt 6998 | . . . 4 ⊢ ((𝐴 +o 𝐵) ∈ V → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)) |
11 | 6, 10 | ax-mp 5 | . . 3 ⊢ ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵) |
12 | oav 8517 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)) | |
13 | 12 | fveq2d 6895 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))) |
14 | 11, 13 | eqtr3id 2785 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴 +o 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))) |
15 | 2, 5, 14 | 3eqtr4d 2781 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 Vcvv 3473 ↦ cmpt 5231 Oncon0 6364 suc csuc 6366 ‘cfv 6543 (class class class)co 7412 reccrdg 8415 +o coa 8469 |
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-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 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-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 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-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-oadd 8476 |
This theorem is referenced by: oacl 8541 oa0r 8544 oaordi 8552 oawordri 8556 oawordeulem 8560 oalimcl 8566 oaass 8567 oarec 8568 odi 8585 oeoalem 8602 oa0suclim 42488 dflim5 42542 naddgeoa 42608 naddonnn 42609 naddwordnexlem4 42615 |
Copyright terms: Public domain | W3C validator |