| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulgnnp1 | Structured version Visualization version GIF version | ||
| Description: Group multiple (exponentiation) operation at a successor. (Contributed by Mario Carneiro, 11-Dec-2014.) |
| Ref | Expression |
|---|---|
| mulg1.b | ⊢ 𝐵 = (Base‘𝐺) |
| mulg1.m | ⊢ · = (.g‘𝐺) |
| mulgnnp1.p | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| mulgnnp1 | ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((𝑁 + 1) · 𝑋) = ((𝑁 · 𝑋) + 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → 𝑁 ∈ ℕ) | |
| 2 | nnuz 12777 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 3 | 1, 2 | eleqtrdi 2843 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → 𝑁 ∈ (ℤ≥‘1)) |
| 4 | seqp1 13925 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( + , (ℕ × {𝑋}))‘(𝑁 + 1)) = ((seq1( + , (ℕ × {𝑋}))‘𝑁) + ((ℕ × {𝑋})‘(𝑁 + 1)))) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (seq1( + , (ℕ × {𝑋}))‘(𝑁 + 1)) = ((seq1( + , (ℕ × {𝑋}))‘𝑁) + ((ℕ × {𝑋})‘(𝑁 + 1)))) |
| 6 | id 22 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
| 7 | peano2nn 12144 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 8 | fvconst2g 7142 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝑋})‘(𝑁 + 1)) = 𝑋) | |
| 9 | 6, 7, 8 | syl2anr 597 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((ℕ × {𝑋})‘(𝑁 + 1)) = 𝑋) |
| 10 | 9 | oveq2d 7368 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((seq1( + , (ℕ × {𝑋}))‘𝑁) + ((ℕ × {𝑋})‘(𝑁 + 1))) = ((seq1( + , (ℕ × {𝑋}))‘𝑁) + 𝑋)) |
| 11 | 5, 10 | eqtrd 2768 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (seq1( + , (ℕ × {𝑋}))‘(𝑁 + 1)) = ((seq1( + , (ℕ × {𝑋}))‘𝑁) + 𝑋)) |
| 12 | mulg1.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 13 | mulgnnp1.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 14 | mulg1.m | . . . 4 ⊢ · = (.g‘𝐺) | |
| 15 | eqid 2733 | . . . 4 ⊢ seq1( + , (ℕ × {𝑋})) = seq1( + , (ℕ × {𝑋})) | |
| 16 | 12, 13, 14, 15 | mulgnn 18990 | . . 3 ⊢ (((𝑁 + 1) ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((𝑁 + 1) · 𝑋) = (seq1( + , (ℕ × {𝑋}))‘(𝑁 + 1))) |
| 17 | 7, 16 | sylan 580 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((𝑁 + 1) · 𝑋) = (seq1( + , (ℕ × {𝑋}))‘(𝑁 + 1))) |
| 18 | 12, 13, 14, 15 | mulgnn 18990 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (seq1( + , (ℕ × {𝑋}))‘𝑁)) |
| 19 | 18 | oveq1d 7367 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((𝑁 · 𝑋) + 𝑋) = ((seq1( + , (ℕ × {𝑋}))‘𝑁) + 𝑋)) |
| 20 | 11, 17, 19 | 3eqtr4d 2778 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → ((𝑁 + 1) · 𝑋) = ((𝑁 · 𝑋) + 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {csn 4575 × cxp 5617 ‘cfv 6486 (class class class)co 7352 1c1 11014 + caddc 11016 ℕcn 12132 ℤ≥cuz 12738 seqcseq 13910 Basecbs 17122 +gcplusg 17163 .gcmg 18982 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-nn 12133 df-n0 12389 df-z 12476 df-uz 12739 df-seq 13911 df-mulg 18983 |
| This theorem is referenced by: mulg2 18998 mulgnn0p1 19000 mulgnnass 19024 ofldchr 21515 psdpw 22086 chfacfpmmulgsum2 22781 xrsmulgzz 32997 ringexp0nn 42247 |
| Copyright terms: Public domain | W3C validator |