| 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 11343. (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 20190 | . . 3 ⊢ (𝜑 → (𝑌 · 𝑍) = (𝑍 · 𝑌)) |
| 7 | 6 | oveq2d 7374 | . 2 ⊢ (𝜑 → (𝑋 · (𝑌 · 𝑍)) = (𝑋 · (𝑍 · 𝑌))) |
| 8 | 3 | crngringd 20181 | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) |
| 9 | crng32d.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 10 | 1, 2, 8, 9, 4, 5 | ringassd 20192 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = (𝑋 · (𝑌 · 𝑍))) |
| 11 | 1, 2, 8, 9, 5, 4 | ringassd 20192 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑍) · 𝑌) = (𝑋 · (𝑍 · 𝑌))) |
| 12 | 7, 10, 11 | 3eqtr4d 2781 | 1 ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = ((𝑋 · 𝑍) · 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 .rcmulr 17178 CRingccrg 20169 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-sgrp 18644 df-mnd 18660 df-cmn 19711 df-mgp 20076 df-ring 20170 df-cring 20171 |
| This theorem is referenced by: psdpw 22113 erlbr2d 33346 erler 33347 rloccring 33352 rprmirredlem 33611 |
| Copyright terms: Public domain | W3C validator |