| 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 9483 | . 2 ⊢ 0 ∈ ℤ | |
| 2 | mulg0.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | eqid 2229 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | mulg0.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 5 | eqid 2229 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | mulg0.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 7 | eqid 2229 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
| 8 | 2, 3, 4, 5, 6, 7 | mulgval 13702 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0))))) |
| 9 | eqid 2229 | . . . 4 ⊢ 0 = 0 | |
| 10 | 9 | iftruei 3609 | . . 3 ⊢ if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0)))) = 0 |
| 11 | 8, 10 | eqtrdi 2278 | . 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 1395 ∈ wcel 2200 ifcif 3603 {csn 3667 class class class wbr 4086 × cxp 4721 ‘cfv 5324 (class class class)co 6013 0cc0 8025 1c1 8026 < clt 8207 -cneg 8344 ℕcn 9136 ℤcz 9472 seqcseq 10702 Basecbs 13075 +gcplusg 13153 0gc0g 13332 invgcminusg 13577 .gcmg 13699 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-addcom 8125 ax-addass 8127 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-0id 8133 ax-rnegex 8134 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-ltadd 8141 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-inn 9137 df-2 9195 df-n0 9396 df-z 9473 df-uz 9749 df-seqfrec 10703 df-ndx 13078 df-slot 13079 df-base 13081 df-plusg 13166 df-0g 13334 df-minusg 13580 df-mulg 13700 |
| This theorem is referenced by: mulgnn0gsum 13708 mulgnn0p1 13713 mulgnn0subcl 13715 mulgneg 13720 mulgaddcom 13726 mulginvcom 13727 mulgnn0z 13729 mulgnn0dir 13732 mulgneg2 13736 mulgnn0ass 13738 mhmmulg 13743 submmulg 13746 srgmulgass 13995 srgpcomp 13996 mulgass2 14064 lmodvsmmulgdi 14330 cnfldmulg 14583 cnfldexp 14584 |
| Copyright terms: Public domain | W3C validator |