| 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 9593 | . 2 ⊢ 0 ∈ ℤ | |
| 2 | mulg0.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | eqid 2234 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | mulg0.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 5 | eqid 2234 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | mulg0.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 7 | eqid 2234 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
| 8 | 2, 3, 4, 5, 6, 7 | mulgval 13860 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0))))) |
| 9 | eqid 2234 | . . . 4 ⊢ 0 = 0 | |
| 10 | 9 | iftruei 3630 | . . 3 ⊢ if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0)))) = 0 |
| 11 | 8, 10 | eqtrdi 2283 | . 2 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = 0 ) |
| 12 | 1, 11 | mpan 424 | 1 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ifcif 3622 {csn 3691 class class class wbr 4111 × cxp 4749 ‘cfv 5354 (class class class)co 6052 0cc0 8132 1c1 8133 < clt 8313 -cneg 8450 ℕcn 9242 ℤcz 9582 seqcseq 10816 Basecbs 13233 +gcplusg 13311 0gc0g 13490 invgcminusg 13735 .gcmg 13857 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-addass 8234 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-frec 6624 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-2 9301 df-n0 9502 df-z 9583 df-uz 9860 df-seqfrec 10817 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-0g 13492 df-minusg 13738 df-mulg 13858 |
| This theorem is referenced by: mulgnn0gsum 13866 mulgnn0p1 13871 mulgnn0subcl 13873 mulgneg 13878 mulgaddcom 13884 mulginvcom 13885 mulgnn0z 13887 mulgnn0dir 13890 mulgneg2 13894 mulgnn0ass 13896 mhmmulg 13901 submmulg 13904 srgmulgass 14154 srgpcomp 14155 mulgass2 14223 lmodvsmmulgdi 14520 cnfldmulg 14773 cnfldexp 14774 |
| Copyright terms: Public domain | W3C validator |