| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > srgpcomppsc | Structured version Visualization version GIF version | ||
| Description: If two elements of a semiring commute, they also commute if the elements are raised to a higher power and a scalar multiplication is involved. (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) |
| srgpcomppsc.t | ⊢ · = (.g‘𝑅) |
| srgpcomppsc.c | ⊢ (𝜑 → 𝐶 ∈ ℕ0) |
| Ref | Expression |
|---|---|
| srgpcomppsc | ⊢ (𝜑 → ((𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵))) × 𝐴) = (𝐶 · (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | srgpcomp.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ SRing) | |
| 2 | srgpcomppsc.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℕ0) | |
| 3 | srgpcomp.g | . . . . . . 7 ⊢ 𝐺 = (mulGrp‘𝑅) | |
| 4 | srgpcomp.s | . . . . . . 7 ⊢ 𝑆 = (Base‘𝑅) | |
| 5 | 3, 4 | mgpbas 20084 | . . . . . 6 ⊢ 𝑆 = (Base‘𝐺) |
| 6 | srgpcomp.e | . . . . . 6 ⊢ ↑ = (.g‘𝐺) | |
| 7 | 3 | srgmgp 20130 | . . . . . . 7 ⊢ (𝑅 ∈ SRing → 𝐺 ∈ Mnd) |
| 8 | 1, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 9 | srgpcompp.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 10 | srgpcomp.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
| 11 | 5, 6, 8, 9, 10 | mulgnn0cld 19029 | . . . . 5 ⊢ (𝜑 → (𝑁 ↑ 𝐴) ∈ 𝑆) |
| 12 | srgpcomp.k | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℕ0) | |
| 13 | srgpcomp.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
| 14 | 5, 6, 8, 12, 13 | mulgnn0cld 19029 | . . . . 5 ⊢ (𝜑 → (𝐾 ↑ 𝐵) ∈ 𝑆) |
| 15 | srgpcomppsc.t | . . . . . . 7 ⊢ · = (.g‘𝑅) | |
| 16 | srgpcomp.m | . . . . . . 7 ⊢ × = (.r‘𝑅) | |
| 17 | 4, 15, 16 | srgmulgass 20156 | . . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ (𝐶 ∈ ℕ0 ∧ (𝑁 ↑ 𝐴) ∈ 𝑆 ∧ (𝐾 ↑ 𝐵) ∈ 𝑆)) → ((𝐶 · (𝑁 ↑ 𝐴)) × (𝐾 ↑ 𝐵)) = (𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)))) |
| 18 | 17 | eqcomd 2743 | . . . . 5 ⊢ ((𝑅 ∈ SRing ∧ (𝐶 ∈ ℕ0 ∧ (𝑁 ↑ 𝐴) ∈ 𝑆 ∧ (𝐾 ↑ 𝐵) ∈ 𝑆)) → (𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵))) = ((𝐶 · (𝑁 ↑ 𝐴)) × (𝐾 ↑ 𝐵))) |
| 19 | 1, 2, 11, 14, 18 | syl13anc 1375 | . . . 4 ⊢ (𝜑 → (𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵))) = ((𝐶 · (𝑁 ↑ 𝐴)) × (𝐾 ↑ 𝐵))) |
| 20 | 19 | oveq1d 7375 | . . 3 ⊢ (𝜑 → ((𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵))) × 𝐴) = (((𝐶 · (𝑁 ↑ 𝐴)) × (𝐾 ↑ 𝐵)) × 𝐴)) |
| 21 | srgmnd 20129 | . . . . . 6 ⊢ (𝑅 ∈ SRing → 𝑅 ∈ Mnd) | |
| 22 | 1, 21 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 23 | 4, 15, 22, 2, 11 | mulgnn0cld 19029 | . . . 4 ⊢ (𝜑 → (𝐶 · (𝑁 ↑ 𝐴)) ∈ 𝑆) |
| 24 | 4, 16 | srgass 20133 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ ((𝐶 · (𝑁 ↑ 𝐴)) ∈ 𝑆 ∧ (𝐾 ↑ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (((𝐶 · (𝑁 ↑ 𝐴)) × (𝐾 ↑ 𝐵)) × 𝐴) = ((𝐶 · (𝑁 ↑ 𝐴)) × ((𝐾 ↑ 𝐵) × 𝐴))) |
| 25 | 1, 23, 14, 10, 24 | syl13anc 1375 | . . 3 ⊢ (𝜑 → (((𝐶 · (𝑁 ↑ 𝐴)) × (𝐾 ↑ 𝐵)) × 𝐴) = ((𝐶 · (𝑁 ↑ 𝐴)) × ((𝐾 ↑ 𝐵) × 𝐴))) |
| 26 | 20, 25 | eqtrd 2772 | . 2 ⊢ (𝜑 → ((𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵))) × 𝐴) = ((𝐶 · (𝑁 ↑ 𝐴)) × ((𝐾 ↑ 𝐵) × 𝐴))) |
| 27 | 4, 16 | srgcl 20132 | . . . . 5 ⊢ ((𝑅 ∈ SRing ∧ (𝐾 ↑ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → ((𝐾 ↑ 𝐵) × 𝐴) ∈ 𝑆) |
| 28 | 1, 14, 10, 27 | syl3anc 1374 | . . . 4 ⊢ (𝜑 → ((𝐾 ↑ 𝐵) × 𝐴) ∈ 𝑆) |
| 29 | 4, 15, 16 | srgmulgass 20156 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ (𝐶 ∈ ℕ0 ∧ (𝑁 ↑ 𝐴) ∈ 𝑆 ∧ ((𝐾 ↑ 𝐵) × 𝐴) ∈ 𝑆)) → ((𝐶 · (𝑁 ↑ 𝐴)) × ((𝐾 ↑ 𝐵) × 𝐴)) = (𝐶 · ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴)))) |
| 30 | 1, 2, 11, 28, 29 | syl13anc 1375 | . . 3 ⊢ (𝜑 → ((𝐶 · (𝑁 ↑ 𝐴)) × ((𝐾 ↑ 𝐵) × 𝐴)) = (𝐶 · ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴)))) |
| 31 | 4, 16 | srgass 20133 | . . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ ((𝑁 ↑ 𝐴) ∈ 𝑆 ∧ (𝐾 ↑ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴))) |
| 32 | 1, 11, 14, 10, 31 | syl13anc 1375 | . . . . 5 ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴))) |
| 33 | 32 | eqcomd 2743 | . . . 4 ⊢ (𝜑 → ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴)) = (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴)) |
| 34 | 33 | oveq2d 7376 | . . 3 ⊢ (𝜑 → (𝐶 · ((𝑁 ↑ 𝐴) × ((𝐾 ↑ 𝐵) × 𝐴))) = (𝐶 · (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴))) |
| 35 | 30, 34 | eqtrd 2772 | . 2 ⊢ (𝜑 → ((𝐶 · (𝑁 ↑ 𝐴)) × ((𝐾 ↑ 𝐵) × 𝐴)) = (𝐶 · (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴))) |
| 36 | srgpcomp.c | . . . 4 ⊢ (𝜑 → (𝐴 × 𝐵) = (𝐵 × 𝐴)) | |
| 37 | 4, 16, 3, 6, 1, 10, 13, 12, 36, 9 | srgpcompp 20158 | . . 3 ⊢ (𝜑 → (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴) = (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵))) |
| 38 | 37 | oveq2d 7376 | . 2 ⊢ (𝜑 → (𝐶 · (((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵)) × 𝐴)) = (𝐶 · (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵)))) |
| 39 | 26, 35, 38 | 3eqtrd 2776 | 1 ⊢ (𝜑 → ((𝐶 · ((𝑁 ↑ 𝐴) × (𝐾 ↑ 𝐵))) × 𝐴) = (𝐶 · (((𝑁 + 1) ↑ 𝐴) × (𝐾 ↑ 𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6493 (class class class)co 7360 1c1 11031 + caddc 11033 ℕ0cn0 12405 Basecbs 17140 .rcmulr 17182 Mndcmnd 18663 .gcmg 19001 mulGrpcmgp 20079 SRingcsrg 20125 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-n0 12406 df-z 12493 df-uz 12756 df-fz 13428 df-seq 13929 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-plusg 17194 df-0g 17365 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-mulg 19002 df-cmn 19715 df-mgp 20080 df-ur 20121 df-srg 20126 |
| This theorem is referenced by: srgbinomlem3 20167 |
| Copyright terms: Public domain | W3C validator |