| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cmn32 | GIF version | ||
| Description: Commutative/associative law for commutative monoids. (Contributed by NM, 4-Feb-2014.) (Revised by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| ablcom.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablcom.p | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| cmn32 | ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablcom.b | . 2 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | ablcom.p | . 2 ⊢ + = (+g‘𝐺) | |
| 3 | cmnmnd 13833 | . . 3 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd) | |
| 4 | 3 | adantr 276 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐺 ∈ Mnd) |
| 5 | simpr1 1027 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 6 | simpr2 1028 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 7 | simpr3 1029 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑍 ∈ 𝐵) | |
| 8 | 1, 2 | cmncom 13834 | . . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 + 𝑍) = (𝑍 + 𝑌)) |
| 9 | 8 | 3adant3r1 1236 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 + 𝑍) = (𝑍 + 𝑌)) |
| 10 | 1, 2, 4, 5, 6, 7, 9 | mnd32g 13455 | 1 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5317 (class class class)co 6000 Basecbs 13027 +gcplusg 13105 Mndcmnd 13444 CMndccmn 13816 |
| 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-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-cnex 8086 ax-resscn 8087 ax-1re 8089 ax-addrcl 8092 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-iota 5277 df-fun 5319 df-fn 5320 df-fv 5325 df-ov 6003 df-inn 9107 df-2 9165 df-ndx 13030 df-slot 13031 df-base 13033 df-plusg 13118 df-sgrp 13430 df-mnd 13445 df-cmn 13818 |
| This theorem is referenced by: abl32 13839 |
| Copyright terms: Public domain | W3C validator |