| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sgrpass | GIF version | ||
| Description: A semigroup operation is associative. (Contributed by FL, 2-Nov-2009.) (Revised by AV, 30-Jan-2020.) |
| Ref | Expression |
|---|---|
| sgrpass.b | ⊢ 𝐵 = (Base‘𝐺) |
| sgrpass.o | ⊢ ⚬ = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| sgrpass | ⊢ ((𝐺 ∈ Smgrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sgrpass.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | sgrpass.o | . . . 4 ⊢ ⚬ = (+g‘𝐺) | |
| 3 | 1, 2 | issgrp 13509 | . . 3 ⊢ (𝐺 ∈ Smgrp ↔ (𝐺 ∈ Mgm ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) |
| 4 | oveq1 6030 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥 ⚬ 𝑦) = (𝑋 ⚬ 𝑦)) | |
| 5 | 4 | oveq1d 6038 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = ((𝑋 ⚬ 𝑦) ⚬ 𝑧)) |
| 6 | oveq1 6030 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ⚬ (𝑦 ⚬ 𝑧)) = (𝑋 ⚬ (𝑦 ⚬ 𝑧))) | |
| 7 | 5, 6 | eqeq12d 2245 | . . . . 5 ⊢ (𝑥 = 𝑋 → (((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) ↔ ((𝑋 ⚬ 𝑦) ⚬ 𝑧) = (𝑋 ⚬ (𝑦 ⚬ 𝑧)))) |
| 8 | oveq2 6031 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋 ⚬ 𝑦) = (𝑋 ⚬ 𝑌)) | |
| 9 | 8 | oveq1d 6038 | . . . . . 6 ⊢ (𝑦 = 𝑌 → ((𝑋 ⚬ 𝑦) ⚬ 𝑧) = ((𝑋 ⚬ 𝑌) ⚬ 𝑧)) |
| 10 | oveq1 6030 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑦 ⚬ 𝑧) = (𝑌 ⚬ 𝑧)) | |
| 11 | 10 | oveq2d 6039 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 ⚬ (𝑦 ⚬ 𝑧)) = (𝑋 ⚬ (𝑌 ⚬ 𝑧))) |
| 12 | 9, 11 | eqeq12d 2245 | . . . . 5 ⊢ (𝑦 = 𝑌 → (((𝑋 ⚬ 𝑦) ⚬ 𝑧) = (𝑋 ⚬ (𝑦 ⚬ 𝑧)) ↔ ((𝑋 ⚬ 𝑌) ⚬ 𝑧) = (𝑋 ⚬ (𝑌 ⚬ 𝑧)))) |
| 13 | oveq2 6031 | . . . . . 6 ⊢ (𝑧 = 𝑍 → ((𝑋 ⚬ 𝑌) ⚬ 𝑧) = ((𝑋 ⚬ 𝑌) ⚬ 𝑍)) | |
| 14 | oveq2 6031 | . . . . . . 7 ⊢ (𝑧 = 𝑍 → (𝑌 ⚬ 𝑧) = (𝑌 ⚬ 𝑍)) | |
| 15 | 14 | oveq2d 6039 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑋 ⚬ (𝑌 ⚬ 𝑧)) = (𝑋 ⚬ (𝑌 ⚬ 𝑍))) |
| 16 | 13, 15 | eqeq12d 2245 | . . . . 5 ⊢ (𝑧 = 𝑍 → (((𝑋 ⚬ 𝑌) ⚬ 𝑧) = (𝑋 ⚬ (𝑌 ⚬ 𝑧)) ↔ ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍)))) |
| 17 | 7, 12, 16 | rspc3v 2925 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) → ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍)))) |
| 18 | 17 | com12 30 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍)))) |
| 19 | 3, 18 | simplbiim 387 | . 2 ⊢ (𝐺 ∈ Smgrp → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍)))) |
| 20 | 19 | imp 124 | 1 ⊢ ((𝐺 ∈ Smgrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 = wceq 1397 ∈ wcel 2201 ∀wral 2509 ‘cfv 5328 (class class class)co 6023 Basecbs 13105 +gcplusg 13183 Mgmcmgm 13460 Smgrpcsgrp 13507 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-cnex 8128 ax-resscn 8129 ax-1re 8131 ax-addrcl 8134 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-rab 2518 df-v 2803 df-sbc 3031 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-iota 5288 df-fun 5330 df-fn 5331 df-fv 5336 df-ov 6026 df-inn 9149 df-2 9207 df-ndx 13108 df-slot 13109 df-base 13111 df-plusg 13196 df-sgrp 13508 |
| This theorem is referenced by: prdssgrpd 13521 mndass 13530 dfgrp2 13633 dfgrp3mlem 13704 dfgrp3me 13706 mulgnndir 13761 rngass 13976 rnglidlmsgrp 14535 |
| Copyright terms: Public domain | W3C validator |