| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > crng12d | Structured version Visualization version GIF version | ||
| Description: Commutative/associative law that swaps the first two factors in a triple product in a commutative ring. See also mul12d 11549. (Contributed by SN, 8-Mar-2025.) |
| Ref | Expression |
|---|---|
| crng12d.b | ⊢ 𝐵 = (Base‘𝑅) |
| crng12d.t | ⊢ · = (.r‘𝑅) |
| crng12d.r | ⊢ (𝜑 → 𝑅 ∈ CRing) |
| crng12d.1 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| crng12d.2 | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| crng12d.3 | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| crng12d | ⊢ (𝜑 → (𝑋 · (𝑌 · 𝑍)) = (𝑌 · (𝑋 · 𝑍))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | crng12d.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | crng12d.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 3 | crng12d.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 4 | crng12d.1 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 5 | crng12d.2 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 6 | 1, 2, 3, 4, 5 | crngcomd 20515 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) = (𝑌 · 𝑋)) |
| 7 | 6 | oveq1d 7461 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = ((𝑌 · 𝑋) · 𝑍)) |
| 8 | 3 | crngringd 20506 | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) |
| 9 | crng12d.3 | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 10 | 1, 2, 8, 4, 5, 9 | ringassd 20518 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) · 𝑍) = (𝑋 · (𝑌 · 𝑍))) |
| 11 | 1, 2, 8, 5, 4, 9 | ringassd 20518 | . 2 ⊢ (𝜑 → ((𝑌 · 𝑋) · 𝑍) = (𝑌 · (𝑋 · 𝑍))) |
| 12 | 7, 10, 11 | 3eqtr3d 2806 | 1 ⊢ (𝜑 → (𝑋 · (𝑌 · 𝑍)) = (𝑌 · (𝑋 · 𝑍))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ‘cfv 6561 (class class class)co 7446 Basecbs 17419 .rcmulr 17461 CRingccrg 20493 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-plusg 17473 df-sgrp 18940 df-mnd 18956 df-cmn 20029 df-mgp 20394 df-ring 20494 df-cring 20495 |
| This theorem is used by: erler 33902 rloccring 33908 rlocisunit 33913 rprmasso2 34142 1arithufdlem3 34162 vietalem 34294 mhphf 43829 |
| Copyright terms: Public domain | W3C validator |