![]() |
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 9331 | . 2 ⊢ 0 ∈ ℤ | |
2 | mulg0.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | eqid 2193 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
4 | mulg0.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
5 | eqid 2193 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
6 | mulg0.t | . . . 4 ⊢ · = (.g‘𝐺) | |
7 | eqid 2193 | . . . 4 ⊢ seq1((+g‘𝐺), (ℕ × {𝑋})) = seq1((+g‘𝐺), (ℕ × {𝑋})) | |
8 | 2, 3, 4, 5, 6, 7 | mulgval 13195 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0))))) |
9 | eqid 2193 | . . . 4 ⊢ 0 = 0 | |
10 | 9 | iftruei 3564 | . . 3 ⊢ if(0 = 0, 0 , if(0 < 0, (seq1((+g‘𝐺), (ℕ × {𝑋}))‘0), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑋}))‘-0)))) = 0 |
11 | 8, 10 | eqtrdi 2242 | . 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 1364 ∈ wcel 2164 ifcif 3558 {csn 3619 class class class wbr 4030 × cxp 4658 ‘cfv 5255 (class class class)co 5919 0cc0 7874 1c1 7875 < clt 8056 -cneg 8193 ℕcn 8984 ℤcz 9320 seqcseq 10521 Basecbs 12621 +gcplusg 12698 0gc0g 12870 invgcminusg 13076 .gcmg 13192 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-addcom 7974 ax-addass 7976 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-0id 7982 ax-rnegex 7983 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-ltadd 7990 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-frec 6446 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-inn 8985 df-2 9043 df-n0 9244 df-z 9321 df-uz 9596 df-seqfrec 10522 df-ndx 12624 df-slot 12625 df-base 12627 df-plusg 12711 df-0g 12872 df-minusg 13079 df-mulg 13193 |
This theorem is referenced by: mulgnn0gsum 13201 mulgnn0p1 13206 mulgnn0subcl 13208 mulgneg 13213 mulgaddcom 13219 mulginvcom 13220 mulgnn0z 13222 mulgnn0dir 13225 mulgneg2 13229 mulgnn0ass 13231 mhmmulg 13236 submmulg 13239 srgmulgass 13488 srgpcomp 13489 mulgass2 13557 lmodvsmmulgdi 13822 cnfldmulg 14075 cnfldexp 14076 |
Copyright terms: Public domain | W3C validator |