| 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 9495 | . 2 ⊢ 0 ∈ ℤ | |
| 2 | mulg0.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | eqid 2230 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | mulg0.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 5 | eqid 2230 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | mulg0.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 7 | eqid 2230 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
| 8 | 2, 3, 4, 5, 6, 7 | mulgval 13732 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0))))) |
| 9 | eqid 2230 | . . . 4 ⊢ 0 = 0 | |
| 10 | 9 | iftruei 3612 | . . 3 ⊢ if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0)))) = 0 |
| 11 | 8, 10 | eqtrdi 2279 | . 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 1397 ∈ wcel 2201 ifcif 3604 {csn 3670 class class class wbr 4089 × cxp 4725 ‘cfv 5328 (class class class)co 6023 0cc0 8037 1c1 8038 < clt 8219 -cneg 8356 ℕcn 9148 ℤcz 9484 seqcseq 10715 Basecbs 13105 +gcplusg 13183 0gc0g 13362 invgcminusg 13607 .gcmg 13729 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-addass 8139 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-0id 8145 ax-rnegex 8146 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-ltadd 8153 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-recs 6476 df-frec 6562 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-inn 9149 df-2 9207 df-n0 9408 df-z 9485 df-uz 9761 df-seqfrec 10716 df-ndx 13108 df-slot 13109 df-base 13111 df-plusg 13196 df-0g 13364 df-minusg 13610 df-mulg 13730 |
| This theorem is referenced by: mulgnn0gsum 13738 mulgnn0p1 13743 mulgnn0subcl 13745 mulgneg 13750 mulgaddcom 13756 mulginvcom 13757 mulgnn0z 13759 mulgnn0dir 13762 mulgneg2 13766 mulgnn0ass 13768 mhmmulg 13773 submmulg 13776 srgmulgass 14026 srgpcomp 14027 mulgass2 14095 lmodvsmmulgdi 14361 cnfldmulg 14614 cnfldexp 14615 |
| Copyright terms: Public domain | W3C validator |