| 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 13637 | . . 3 ⊢ (𝐺 ∈ Smgrp ↔ (𝐺 ∈ Mgm ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) |
| 4 | oveq1 6059 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥 ⚬ 𝑦) = (𝑋 ⚬ 𝑦)) | |
| 5 | 4 | oveq1d 6067 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = ((𝑋 ⚬ 𝑦) ⚬ 𝑧)) |
| 6 | oveq1 6059 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ⚬ (𝑦 ⚬ 𝑧)) = (𝑋 ⚬ (𝑦 ⚬ 𝑧))) | |
| 7 | 5, 6 | eqeq12d 2249 | . . . . 5 ⊢ (𝑥 = 𝑋 → (((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) ↔ ((𝑋 ⚬ 𝑦) ⚬ 𝑧) = (𝑋 ⚬ (𝑦 ⚬ 𝑧)))) |
| 8 | oveq2 6060 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋 ⚬ 𝑦) = (𝑋 ⚬ 𝑌)) | |
| 9 | 8 | oveq1d 6067 | . . . . . 6 ⊢ (𝑦 = 𝑌 → ((𝑋 ⚬ 𝑦) ⚬ 𝑧) = ((𝑋 ⚬ 𝑌) ⚬ 𝑧)) |
| 10 | oveq1 6059 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑦 ⚬ 𝑧) = (𝑌 ⚬ 𝑧)) | |
| 11 | 10 | oveq2d 6068 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 ⚬ (𝑦 ⚬ 𝑧)) = (𝑋 ⚬ (𝑌 ⚬ 𝑧))) |
| 12 | 9, 11 | eqeq12d 2249 | . . . . 5 ⊢ (𝑦 = 𝑌 → (((𝑋 ⚬ 𝑦) ⚬ 𝑧) = (𝑋 ⚬ (𝑦 ⚬ 𝑧)) ↔ ((𝑋 ⚬ 𝑌) ⚬ 𝑧) = (𝑋 ⚬ (𝑌 ⚬ 𝑧)))) |
| 13 | oveq2 6060 | . . . . . 6 ⊢ (𝑧 = 𝑍 → ((𝑋 ⚬ 𝑌) ⚬ 𝑧) = ((𝑋 ⚬ 𝑌) ⚬ 𝑍)) | |
| 14 | oveq2 6060 | . . . . . . 7 ⊢ (𝑧 = 𝑍 → (𝑌 ⚬ 𝑧) = (𝑌 ⚬ 𝑍)) | |
| 15 | 14 | oveq2d 6068 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑋 ⚬ (𝑌 ⚬ 𝑧)) = (𝑋 ⚬ (𝑌 ⚬ 𝑍))) |
| 16 | 13, 15 | eqeq12d 2249 | . . . . 5 ⊢ (𝑧 = 𝑍 → (((𝑋 ⚬ 𝑌) ⚬ 𝑧) = (𝑋 ⚬ (𝑌 ⚬ 𝑧)) ↔ ((𝑋 ⚬ 𝑌) ⚬ 𝑍) = (𝑋 ⚬ (𝑌 ⚬ 𝑍)))) |
| 17 | 7, 12, 16 | rspc3v 2939 | . . . 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 1005 = wceq 1398 ∈ wcel 2205 ∀wral 2522 ‘cfv 5354 (class class class)co 6052 Basecbs 13233 +gcplusg 13311 Mgmcmgm 13588 Smgrpcsgrp 13635 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-cnex 8223 ax-resscn 8224 ax-1re 8226 ax-addrcl 8229 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3045 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-iota 5314 df-fun 5356 df-fn 5357 df-fv 5362 df-ov 6055 df-inn 9243 df-2 9301 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-sgrp 13636 |
| This theorem is referenced by: prdssgrpd 13649 mndass 13658 dfgrp2 13761 dfgrp3mlem 13832 dfgrp3me 13834 mulgnndir 13889 rngass 14104 rnglidlmsgrp 14694 |
| Copyright terms: Public domain | W3C validator |