| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulg0 | 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 9638 | . 2 ⊢ 0 ∈ ℤ | |
| 2 | mulg0.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | eqid 2238 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | mulg0.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 5 | eqid 2238 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | mulg0.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 7 | eqid 2238 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
| 8 | 2, 3, 4, 5, 6, 7 | mulgval 13908 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0))))) |
| 9 | eqid 2238 | . . . 4 ⊢ 0 = 0 | |
| 10 | 9 | iftruei 3646 | . . 3 ⊢ if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0)))) = 0 |
| 11 | 8, 10 | eqtrdi 2287 | . 2 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = 0 ) |
| 12 | 1, 11 | mpan 428 | 1 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ifcif 3638 {csn 3708 class class class wbr 4128 × cxp 4770 ‘cfv 5375 (class class class)co 6079 0cc0 8173 1c1 8174 < clt 8354 -cneg 8492 ℕcn 9287 ℤcz 9627 seqcseq 10867 Basecbs 13335 +gcplusg 13414 0gc0g 13593 invgcminusg 13789 .gcmg 13905 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-frec 6656 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-2 9346 df-n0 9547 df-z 9628 df-uz 9905 df-seqfrec 10868 df-ndx 13338 df-slot 13339 df-base 13341 df-plusg 13427 df-0g 13595 df-minusg 13792 df-mulg 13906 |
| This theorem is referenced by: mulgnn0gzsum 13914 mulgnn0p1 13919 mulgnn0subcl 13921 mulgneg 13926 mulgaddcom 13932 mulginvcom 13933 mulgnn0z 13935 mulgnn0dir 13938 mulgneg2 13942 mulgnn0ass 13944 mhmmulg 13949 submmulg 13952 gsumconstcmn 14149 srgmulgass 14276 srgpcomp 14277 mulgass2 14346 lmodvsmmulgdi 14643 cnfldmulg 14896 cnfldexp 14897 assamulgscmlem1 15024 |
| Copyright terms: Public domain | W3C validator |