![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mulg0 | Structured version Visualization version GIF version |
Description: Group multiple (exponentiation) operation at zero. (Contributed by Mario Carneiro, 11-Dec-2014.) |
Ref | Expression |
---|---|
mulg0.b | ⊢ 𝐵 = (Base‘𝐺) |
mulg0.o | ⊢ 0 = (0g‘𝐺) |
mulg0.t | ⊢ · = (.g‘𝐺) |
Ref | Expression |
---|---|
mulg0 | ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0z 11600 | . 2 ⊢ 0 ∈ ℤ | |
2 | mulg0.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | eqid 2760 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
4 | mulg0.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
5 | eqid 2760 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
6 | mulg0.t | . . . 4 ⊢ · = (.g‘𝐺) | |
7 | eqid 2760 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
8 | 2, 3, 4, 5, 6, 7 | mulgval 17764 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0))))) |
9 | eqid 2760 | . . . 4 ⊢ 0 = 0 | |
10 | 9 | iftruei 4237 | . . 3 ⊢ if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0)))) = 0 |
11 | 8, 10 | syl6eq 2810 | . 2 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = 0 ) |
12 | 1, 11 | mpan 708 | 1 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1632 ∈ wcel 2139 ifcif 4230 {csn 4321 class class class wbr 4804 × cxp 5264 ‘cfv 6049 (class class class)co 6814 0cc0 10148 1c1 10149 < clt 10286 -cneg 10479 ℕcn 11232 ℤcz 11589 seqcseq 13015 Basecbs 16079 +gcplusg 16163 0gc0g 16322 invgcminusg 17644 .gcmg 17761 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-inf2 8713 ax-cnex 10204 ax-resscn 10205 ax-1cn 10206 ax-icn 10207 ax-addcl 10208 ax-addrcl 10209 ax-mulcl 10210 ax-mulrcl 10211 ax-i2m1 10216 ax-1ne0 10217 ax-rnegex 10219 ax-rrecex 10220 ax-cnre 10221 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-ral 3055 df-rex 3056 df-reu 3057 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-om 7232 df-1st 7334 df-2nd 7335 df-wrecs 7577 df-recs 7638 df-rdg 7676 df-neg 10481 df-z 11590 df-seq 13016 df-mulg 17762 |
This theorem is referenced by: mulgnn0p1 17773 mulgnn0subcl 17775 mulgneg 17781 mulgaddcom 17785 mulginvcom 17786 mulgnn0z 17788 mulgnn0dir 17792 mulgneg2 17796 mulgnn0ass 17799 mhmmulg 17804 submmulg 17807 odid 18177 oddvdsnn0 18183 oddvds 18186 odf1 18199 gexid 18216 mulgnn0di 18451 0cyg 18514 gsumconst 18554 srgmulgass 18751 srgpcomp 18752 srgbinomlem3 18762 srgbinomlem4 18763 srgbinom 18765 mulgass2 18821 lmodvsmmulgdi 19120 assamulgscmlem1 19570 mplcoe3 19688 mplcoe5 19690 mplbas2 19692 psrbagev1 19732 evlslem3 19736 evlslem1 19737 ply1scltm 19873 cnfldmulg 20000 cnfldexp 20001 chfacfscmulgsum 20887 chfacfpmmulgsum 20891 cpmadugsumlemF 20903 tmdmulg 22117 clmmulg 23121 dchrptlem2 25210 xrsmulgzz 30008 ressmulgnn0 30014 omndmul2 30042 omndmul 30044 archirng 30072 archirngz 30073 archiabllem1b 30076 archiabllem2c 30079 lmodvsmdi 42691 |
Copyright terms: Public domain | W3C validator |