Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulg1 | Structured version Visualization version GIF version |
Description: Group multiple (exponentiation) operation at one. (Contributed by Mario Carneiro, 11-Dec-2014.) |
Ref | Expression |
---|---|
mulg1.b | ⊢ 𝐵 = (Base‘𝐺) |
mulg1.m | ⊢ · = (.g‘𝐺) |
Ref | Expression |
---|---|
mulg1 | ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1nn 11652 | . . 3 ⊢ 1 ∈ ℕ | |
2 | mulg1.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | eqid 2824 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
4 | mulg1.m | . . . 4 ⊢ · = (.g‘𝐺) | |
5 | eqid 2824 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
6 | 2, 3, 4, 5 | mulgnn 18235 | . . 3 ⊢ ((1 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (1 · 𝑋) = (seq1((+g‘𝐺), (ℕ × {𝑋}))‘1)) |
7 | 1, 6 | mpan 688 | . 2 ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = (seq1((+g‘𝐺), (ℕ × {𝑋}))‘1)) |
8 | 1z 12015 | . . 3 ⊢ 1 ∈ ℤ | |
9 | fvconst2g 6967 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 1 ∈ ℕ) → ((ℕ × {𝑋})‘1) = 𝑋) | |
10 | 1, 9 | mpan2 689 | . . 3 ⊢ (𝑋 ∈ 𝐵 → ((ℕ × {𝑋})‘1) = 𝑋) |
11 | 8, 10 | seq1i 13386 | . 2 ⊢ (𝑋 ∈ 𝐵 → (seq1((+g‘𝐺), (ℕ × {𝑋}))‘1) = 𝑋) |
12 | 7, 11 | eqtrd 2859 | 1 ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 {csn 4570 × cxp 5556 ‘cfv 6358 (class class class)co 7159 1c1 10541 ℕcn 11641 seqcseq 13372 Basecbs 16486 +gcplusg 16568 .gcmg 18227 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-n0 11901 df-z 11985 df-uz 12247 df-seq 13373 df-mulg 18228 |
This theorem is referenced by: mulg2 18240 mulgnn0p1 18242 mulgm1 18251 mulgp1 18263 mulgnnass 18265 cycsubmcl 18347 cycsubggend 18351 cycsubgcl 18352 odbezout 18688 od1 18689 odeq1 18690 gex1 18719 gsumsnfd 19074 ablfacrp 19191 pgpfac1lem2 19200 pgpfac1lem3 19202 ablsimpgfindlem1 19232 srgbinom 19298 evlslem1 20298 mulgrhm 20648 zlmlmod 20673 frgpcyg 20723 m2detleiblem5 21237 cayhamlem1 21477 cpmadugsumlemB 21485 ply1remlem 24759 fta1blem 24765 xrsmulgzz 30669 omndmul2 30717 isarchi3 30820 archirngz 30822 archiabllem1a 30824 freshmansdream 30863 ofldchr 30891 ply1vr1smo 44442 |
Copyright terms: Public domain | W3C validator |