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 11649 | . . 3 ⊢ 1 ∈ ℕ | |
2 | mulg1.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | eqid 2821 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
4 | mulg1.m | . . . 4 ⊢ · = (.g‘𝐺) | |
5 | eqid 2821 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
6 | 2, 3, 4, 5 | mulgnn 18232 | . . 3 ⊢ ((1 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (1 · 𝑋) = (seq1((+g‘𝐺), (ℕ × {𝑋}))‘1)) |
7 | 1, 6 | mpan 688 | . 2 ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = (seq1((+g‘𝐺), (ℕ × {𝑋}))‘1)) |
8 | 1z 12013 | . . 3 ⊢ 1 ∈ ℤ | |
9 | fvconst2g 6964 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 1 ∈ ℕ) → ((ℕ × {𝑋})‘1) = 𝑋) | |
10 | 1, 9 | mpan2 689 | . . 3 ⊢ (𝑋 ∈ 𝐵 → ((ℕ × {𝑋})‘1) = 𝑋) |
11 | 8, 10 | seq1i 13384 | . 2 ⊢ (𝑋 ∈ 𝐵 → (seq1((+g‘𝐺), (ℕ × {𝑋}))‘1) = 𝑋) |
12 | 7, 11 | eqtrd 2856 | 1 ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 {csn 4567 × cxp 5553 ‘cfv 6355 (class class class)co 7156 1c1 10538 ℕcn 11638 seqcseq 13370 Basecbs 16483 +gcplusg 16565 .gcmg 18224 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 df-uz 12245 df-seq 13371 df-mulg 18225 |
This theorem is referenced by: mulg2 18237 mulgnn0p1 18239 mulgm1 18248 mulgp1 18260 mulgnnass 18262 cycsubmcl 18344 cycsubggend 18348 cycsubgcl 18349 odbezout 18685 od1 18686 odeq1 18687 gex1 18716 gsumsnfd 19071 ablfacrp 19188 pgpfac1lem2 19197 pgpfac1lem3 19199 ablsimpgfindlem1 19229 srgbinom 19295 evlslem1 20295 mulgrhm 20645 zlmlmod 20670 frgpcyg 20720 m2detleiblem5 21234 cayhamlem1 21474 cpmadugsumlemB 21482 ply1remlem 24756 fta1blem 24762 xrsmulgzz 30665 omndmul2 30713 isarchi3 30816 archirngz 30818 archiabllem1a 30820 freshmansdream 30859 ofldchr 30887 ply1vr1smo 44455 |
Copyright terms: Public domain | W3C validator |