![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > srgpcompp | GIF version |
Description: If two elements of a semiring commute, they also commute if the elements are raised to a higher power. (Contributed by AV, 23-Aug-2019.) |
Ref | Expression |
---|---|
srgpcomp.s | ⊢ 𝑆 = (Base‘𝑅) |
srgpcomp.m | ⊢ × = (.r‘𝑅) |
srgpcomp.g | ⊢ 𝐺 = (mulGrp‘𝑅) |
srgpcomp.e | ⊢ ↑ = (.g‘𝐺) |
srgpcomp.r | ⊢ (𝜑 → 𝑅 ∈ SRing) |
srgpcomp.a | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
srgpcomp.b | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
srgpcomp.k | ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
srgpcomp.c | ⊢ (𝜑 → (𝐴 × 𝐵) = (𝐵 × 𝐴)) |
srgpcompp.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
Ref | Expression |
---|---|
srgpcompp | ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | srgpcomp.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ SRing) | |
2 | srgpcomp.g | . . . . . . 7 ⊢ 𝐺 = (mulGrp‘𝑅) | |
3 | 2 | srgmgp 13464 | . . . . . 6 ⊢ (𝑅 ∈ SRing → 𝐺 ∈ Mnd) |
4 | 1, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
5 | srgpcompp.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
6 | srgpcomp.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
7 | srgpcomp.s | . . . . . . . 8 ⊢ 𝑆 = (Base‘𝑅) | |
8 | 2, 7 | mgpbasg 13422 | . . . . . . 7 ⊢ (𝑅 ∈ SRing → 𝑆 = (Base‘𝐺)) |
9 | 1, 8 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝑆 = (Base‘𝐺)) |
10 | 6, 9 | eleqtrd 2272 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ (Base‘𝐺)) |
11 | eqid 2193 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
12 | srgpcomp.e | . . . . . 6 ⊢ ↑ = (.g‘𝐺) | |
13 | 11, 12 | mulgnn0cl 13208 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ (Base‘𝐺)) → (𝑁 ↑ 𝐴) ∈ (Base‘𝐺)) |
14 | 4, 5, 10, 13 | syl3anc 1249 | . . . 4 ⊢ (𝜑 → (𝑁 ↑ 𝐴) ∈ (Base‘𝐺)) |
15 | 14, 9 | eleqtrrd 2273 | . . 3 ⊢ (𝜑 → (𝑁 ↑ 𝐴) ∈ 𝑆) |
16 | srgpcomp.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℕ0) | |
17 | srgpcomp.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
18 | 17, 9 | eleqtrd 2272 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (Base‘𝐺)) |
19 | 11, 12 | mulgnn0cl 13208 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝐾 ∈ ℕ0 ∧ 𝐵 ∈ (Base‘𝐺)) → (𝐾 ↑ 𝐵) ∈ (Base‘𝐺)) |
20 | 4, 16, 18, 19 | syl3anc 1249 | . . . 4 ⊢ (𝜑 → (𝐾 ↑ 𝐵) ∈ (Base‘𝐺)) |
21 | 20, 9 | eleqtrrd 2273 | . . 3 ⊢ (𝜑 → (𝐾 ↑ 𝐵) ∈ 𝑆) |
22 | srgpcomp.m | . . . 4 ⊢ × = (.r‘𝑅) | |
23 | 7, 22 | srgass 13467 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ ((𝑁 ↑ 𝐴) ∈ 𝑆 ∧ (𝐾 ↑ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴))) |
24 | 1, 15, 21, 6, 23 | syl13anc 1251 | . 2 ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴))) |
25 | srgpcomp.c | . . . . 5 ⊢ (𝜑 → (𝐴 × 𝐵) = (𝐵 × 𝐴)) | |
26 | 7, 22, 2, 12, 1, 6, 17, 16, 25 | srgpcomp 13486 | . . . 4 ⊢ (𝜑 → ((𝐾 ↑ 𝐵) × 𝐴) = (𝐴 × (𝐾 ↑ 𝐵))) |
27 | 26 | oveq2d 5934 | . . 3 ⊢ (𝜑 → ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴)) = ((𝑁 ↑ 𝐴) × (𝐴 × (𝐾 ↑ 𝐵)))) |
28 | 7, 22 | srgass 13467 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ ((𝑁 ↑ 𝐴) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆 ∧ (𝐾 ↑ 𝐵) ∈ 𝑆)) → (((𝑁 ↑ 𝐴) × 𝐴) × (𝐾 ↑ 𝐵)) = ((𝑁 ↑ 𝐴) × (𝐴 × (𝐾 ↑ 𝐵)))) |
29 | 1, 15, 6, 21, 28 | syl13anc 1251 | . . 3 ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × 𝐴) × (𝐾 ↑ 𝐵)) = ((𝑁 ↑ 𝐴) × (𝐴 × (𝐾 ↑ 𝐵)))) |
30 | 27, 29 | eqtr4d 2229 | . 2 ⊢ (𝜑 → ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴)) = (((𝑁 ↑ 𝐴) × 𝐴) × (𝐾 ↑ 𝐵))) |
31 | 2, 22 | mgpplusgg 13420 | . . . . . 6 ⊢ (𝑅 ∈ SRing → × = (+g‘𝐺)) |
32 | 1, 31 | syl 14 | . . . . 5 ⊢ (𝜑 → × = (+g‘𝐺)) |
33 | 32 | oveqd 5935 | . . . 4 ⊢ (𝜑 → ((𝑁 ↑ 𝐴) × 𝐴) = ((𝑁 ↑ 𝐴)(+g‘𝐺)𝐴)) |
34 | eqid 2193 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
35 | 11, 12, 34 | mulgnn0p1 13203 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ (Base‘𝐺)) → ((𝑁 + 1) ↑ 𝐴) = ((𝑁 ↑ 𝐴)(+g‘𝐺)𝐴)) |
36 | 4, 5, 10, 35 | syl3anc 1249 | . . . 4 ⊢ (𝜑 → ((𝑁 + 1) ↑ 𝐴) = ((𝑁 ↑ 𝐴)(+g‘𝐺)𝐴)) |
37 | 33, 36 | eqtr4d 2229 | . . 3 ⊢ (𝜑 → ((𝑁 ↑ 𝐴) × 𝐴) = ((𝑁 + 1) ↑ 𝐴)) |
38 | 37 | oveq1d 5933 | . 2 ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × 𝐴) × (𝐾 ↑ 𝐵)) = (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵))) |
39 | 24, 30, 38 | 3eqtrd 2230 | 1 ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2164 ‘cfv 5254 (class class class)co 5918 1c1 7873 + caddc 7875 ℕ0cn0 9240 Basecbs 12618 +gcplusg 12695 .rcmulr 12696 Mndcmnd 12997 .gcmg 13189 mulGrpcmgp 13416 SRingcsrg 13459 |
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 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-ltadd 7988 |
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-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-inn 8983 df-2 9041 df-3 9042 df-n0 9241 df-z 9318 df-uz 9593 df-seqfrec 10519 df-ndx 12621 df-slot 12622 df-base 12624 df-sets 12625 df-plusg 12708 df-mulr 12709 df-0g 12869 df-mgm 12939 df-sgrp 12985 df-mnd 12998 df-minusg 13076 df-mulg 13190 df-mgp 13417 df-ur 13456 df-srg 13460 |
This theorem is referenced by: srgpcomppsc 13488 |
Copyright terms: Public domain | W3C validator |