| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > crng32d | Structured version Visualization version GIF version | ||
| Description: Commutative/associative law that swaps the last two factors in a triple product in a commutative ring. See also mul32d 11362. (Contributed by Thierry Arnoux, 4-May-2025.) |
| Ref | Expression |
|---|---|
| crng32d.b | ⊢ 𝐵 = (Base‘𝑅) |
| crng32d.t | ⊢ · = (.r‘𝑅) |
| crng32d.r | ⊢ (𝜑 → 𝑅 ∈ CRing) |
| crng32d.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| crng32d.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| crng32d.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| crng32d | ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = ((𝑋 · 𝑍) · 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | crng32d.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | crng32d.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 3 | crng32d.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 4 | crng32d.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 5 | crng32d.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 6 | 1, 2, 3, 4, 5 | crngcomd 20176 | . . 3 ⊢ (𝜑 → (𝑌 · 𝑍) = (𝑍 · 𝑌)) |
| 7 | 6 | oveq2d 7385 | . 2 ⊢ (𝜑 → (𝑋 · (𝑌 · 𝑍)) = (𝑋 · (𝑍 · 𝑌))) |
| 8 | 3 | crngringd 20167 | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) |
| 9 | crng32d.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 10 | 1, 2, 8, 9, 4, 5 | ringassd 20178 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = (𝑋 · (𝑌 · 𝑍))) |
| 11 | 1, 2, 8, 9, 5, 4 | ringassd 20178 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑍) · 𝑌) = (𝑋 · (𝑍 · 𝑌))) |
| 12 | 7, 10, 11 | 3eqtr4d 2774 | 1 ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = ((𝑋 · 𝑍) · 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ‘cfv 6499 (class class class)co 7369 Basecbs 17156 .rcmulr 17198 CRingccrg 20155 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11102 ax-resscn 11103 ax-1cn 11104 ax-icn 11105 ax-addcl 11106 ax-addrcl 11107 ax-mulcl 11108 ax-mulrcl 11109 ax-mulcom 11110 ax-addass 11111 ax-mulass 11112 ax-distr 11113 ax-i2m1 11114 ax-1ne0 11115 ax-1rid 11116 ax-rnegex 11117 ax-rrecex 11118 ax-cnre 11119 ax-pre-lttri 11120 ax-pre-lttrn 11121 ax-pre-ltadd 11122 ax-pre-mulgt0 11123 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11188 df-mnf 11189 df-xr 11190 df-ltxr 11191 df-le 11192 df-sub 11385 df-neg 11386 df-nn 12165 df-2 12227 df-sets 17111 df-slot 17129 df-ndx 17141 df-base 17157 df-plusg 17210 df-sgrp 18629 df-mnd 18645 df-cmn 19697 df-mgp 20062 df-ring 20156 df-cring 20157 |
| This theorem is referenced by: psdpw 22091 erlbr2d 33232 erler 33233 rloccring 33238 rprmirredlem 33495 |
| Copyright terms: Public domain | W3C validator |