| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpidssd | GIF version | ||
| Description: If the base set of a group is contained in the base set of another group, and the group operation of the group is the restriction of the group operation of the other group to its base set, then both groups have the same identity element. (Contributed by AV, 15-Mar-2019.) |
| Ref | Expression |
|---|---|
| grpidssd.m | ⊢ (𝜑 → 𝑀 ∈ Grp) |
| grpidssd.s | ⊢ (𝜑 → 𝑆 ∈ Grp) |
| grpidssd.b | ⊢ 𝐵 = (Base‘𝑆) |
| grpidssd.c | ⊢ (𝜑 → 𝐵 ⊆ (Base‘𝑀)) |
| grpidssd.o | ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) |
| Ref | Expression |
|---|---|
| grpidssd | ⊢ (𝜑 → (0g‘𝑀) = (0g‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpidssd.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ Grp) | |
| 2 | grpidssd.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑆) | |
| 3 | eqid 2234 | . . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 4 | 2, 3 | grpidcl 13763 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝐵) |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (0g‘𝑆) ∈ 𝐵) |
| 6 | grpidssd.o | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) | |
| 7 | oveq1 6059 | . . . . . . 7 ⊢ (𝑥 = (0g‘𝑆) → (𝑥(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑀)𝑦)) | |
| 8 | oveq1 6059 | . . . . . . 7 ⊢ (𝑥 = (0g‘𝑆) → (𝑥(+g‘𝑆)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦)) | |
| 9 | 7, 8 | eqeq12d 2249 | . . . . . 6 ⊢ (𝑥 = (0g‘𝑆) → ((𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦) ↔ ((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦))) |
| 10 | oveq2 6060 | . . . . . . 7 ⊢ (𝑦 = (0g‘𝑆) → ((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆))) | |
| 11 | oveq2 6060 | . . . . . . 7 ⊢ (𝑦 = (0g‘𝑆) → ((0g‘𝑆)(+g‘𝑆)𝑦) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) | |
| 12 | 10, 11 | eqeq12d 2249 | . . . . . 6 ⊢ (𝑦 = (0g‘𝑆) → (((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦) ↔ ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)))) |
| 13 | 9, 12 | rspc2va 2937 | . . . . 5 ⊢ ((((0g‘𝑆) ∈ 𝐵 ∧ (0g‘𝑆) ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) |
| 14 | 5, 5, 6, 13 | syl21anc 1273 | . . . 4 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) |
| 15 | eqid 2234 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 16 | 2, 15, 3 | grplid 13765 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (0g‘𝑆) ∈ 𝐵) → ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)) = (0g‘𝑆)) |
| 17 | 1, 4, 16 | syl2anc2 412 | . . . 4 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)) = (0g‘𝑆)) |
| 18 | 14, 17 | eqtrd 2267 | . . 3 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆)) |
| 19 | grpidssd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ Grp) | |
| 20 | grpidssd.c | . . . . 5 ⊢ (𝜑 → 𝐵 ⊆ (Base‘𝑀)) | |
| 21 | 20, 5 | sseldd 3241 | . . . 4 ⊢ (𝜑 → (0g‘𝑆) ∈ (Base‘𝑀)) |
| 22 | eqid 2234 | . . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 23 | eqid 2234 | . . . . 5 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 24 | eqid 2234 | . . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 25 | 22, 23, 24 | grpidlcan 13800 | . . . 4 ⊢ ((𝑀 ∈ Grp ∧ (0g‘𝑆) ∈ (Base‘𝑀) ∧ (0g‘𝑆) ∈ (Base‘𝑀)) → (((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆) ↔ (0g‘𝑆) = (0g‘𝑀))) |
| 26 | 19, 21, 21, 25 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆) ↔ (0g‘𝑆) = (0g‘𝑀))) |
| 27 | 18, 26 | mpbid 147 | . 2 ⊢ (𝜑 → (0g‘𝑆) = (0g‘𝑀)) |
| 28 | 27 | eqcomd 2240 | 1 ⊢ (𝜑 → (0g‘𝑀) = (0g‘𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∀wral 2522 ⊆ wss 3213 ‘cfv 5354 (class class class)co 6052 Basecbs 13233 +gcplusg 13311 0gc0g 13490 Grpcgrp 13734 |
| 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-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 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-riota 6005 df-ov 6055 df-inn 9243 df-2 9301 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-0g 13492 df-mgm 13590 df-sgrp 13636 df-mnd 13651 df-grp 13737 |
| This theorem is referenced by: grpinvssd 13811 |
| Copyright terms: Public domain | W3C validator |