| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > omsuc | Structured version Visualization version GIF version | ||
| Description: Multiplication with successor. Definition 8.15 of [TakeutiZaring] p. 62. Definition 2.5 of [Schloeder] p. 4. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 8-Sep-2013.) |
| Ref | Expression |
|---|---|
| omsuc | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = ((𝐴 ·o 𝐵) +o 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rdgsuc 8407 | . . 3 ⊢ (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))) | |
| 2 | 1 | adantl 486 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))) |
| 3 | onsuc 7805 | . . 3 ⊢ (𝐵 ∈ On → suc 𝐵 ∈ On) | |
| 4 | omv 8493 | . . 3 ⊢ ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵)) | |
| 5 | 3, 4 | sylan2 604 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵)) |
| 6 | ovex 7443 | . . . 4 ⊢ (𝐴 ·o 𝐵) ∈ V | |
| 7 | oveq1 7417 | . . . . 5 ⊢ (𝑥 = (𝐴 ·o 𝐵) → (𝑥 +o 𝐴) = ((𝐴 ·o 𝐵) +o 𝐴)) | |
| 8 | eqid 2763 | . . . . 5 ⊢ (𝑥 ∈ V ↦ (𝑥 +o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 +o 𝐴)) | |
| 9 | ovex 7443 | . . . . 5 ⊢ ((𝐴 ·o 𝐵) +o 𝐴) ∈ V | |
| 10 | 7, 8, 9 | fvmpt 6989 | . . . 4 ⊢ ((𝐴 ·o 𝐵) ∈ V → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴)) |
| 11 | 6, 10 | ax-mp 5 | . . 3 ⊢ ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴) |
| 12 | omv 8493 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)) | |
| 13 | 12 | fveq2d 6885 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))) |
| 14 | 11, 13 | eqtr3id 2812 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ·o 𝐵) +o 𝐴) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))) |
| 15 | 2, 5, 14 | 3eqtr4d 2808 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = ((𝐴 ·o 𝐵) +o 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∅c0 4286 ↦ cmpt 5192 Oncon0 6360 suc csuc 6362 ‘cfv 6536 (class class class)co 7410 reccrdg 8392 +o coa 8446 ·o comu 8447 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-un 7732 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-omul 8454 |
| This theorem is used by: omcl 8517 om0r 8520 om1r 8524 omordi 8547 omwordri 8553 omlimcl 8559 odi 8560 omass 8561 oneo 8562 omeulem1 8563 omeulem2 8564 om2 8567 oeoelem 8580 oaabs2 8631 omxpenlem 9062 cantnflt 9637 cantnflem1d 9653 infxpenc 10007 onexomgt 43996 omlimcl2 43997 onexoegt 43999 om0suclim 44031 oaomoencom 44072 omabs2 44087 naddwordnexlem0 44151 naddwordnexlem3 44154 |
| Copyright terms: Public domain | W3C validator |