| 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 2229 | . . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 4 | 2, 3 | grpidcl 13605 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝐵) |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (0g‘𝑆) ∈ 𝐵) |
| 6 | grpidssd.o | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) | |
| 7 | oveq1 6020 | . . . . . . 7 ⊢ (𝑥 = (0g‘𝑆) → (𝑥(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑀)𝑦)) | |
| 8 | oveq1 6020 | . . . . . . 7 ⊢ (𝑥 = (0g‘𝑆) → (𝑥(+g‘𝑆)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦)) | |
| 9 | 7, 8 | eqeq12d 2244 | . . . . . 6 ⊢ (𝑥 = (0g‘𝑆) → ((𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦) ↔ ((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦))) |
| 10 | oveq2 6021 | . . . . . . 7 ⊢ (𝑦 = (0g‘𝑆) → ((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆))) | |
| 11 | oveq2 6021 | . . . . . . 7 ⊢ (𝑦 = (0g‘𝑆) → ((0g‘𝑆)(+g‘𝑆)𝑦) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) | |
| 12 | 10, 11 | eqeq12d 2244 | . . . . . 6 ⊢ (𝑦 = (0g‘𝑆) → (((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦) ↔ ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)))) |
| 13 | 9, 12 | rspc2va 2922 | . . . . 5 ⊢ ((((0g‘𝑆) ∈ 𝐵 ∧ (0g‘𝑆) ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) |
| 14 | 5, 5, 6, 13 | syl21anc 1270 | . . . 4 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) |
| 15 | eqid 2229 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 16 | 2, 15, 3 | grplid 13607 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (0g‘𝑆) ∈ 𝐵) → ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)) = (0g‘𝑆)) |
| 17 | 1, 4, 16 | syl2anc2 412 | . . . 4 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)) = (0g‘𝑆)) |
| 18 | 14, 17 | eqtrd 2262 | . . 3 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆)) |
| 19 | grpidssd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ Grp) | |
| 20 | grpidssd.c | . . . . 5 ⊢ (𝜑 → 𝐵 ⊆ (Base‘𝑀)) | |
| 21 | 20, 5 | sseldd 3226 | . . . 4 ⊢ (𝜑 → (0g‘𝑆) ∈ (Base‘𝑀)) |
| 22 | eqid 2229 | . . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 23 | eqid 2229 | . . . . 5 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 24 | eqid 2229 | . . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 25 | 22, 23, 24 | grpidlcan 13642 | . . . 4 ⊢ ((𝑀 ∈ Grp ∧ (0g‘𝑆) ∈ (Base‘𝑀) ∧ (0g‘𝑆) ∈ (Base‘𝑀)) → (((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆) ↔ (0g‘𝑆) = (0g‘𝑀))) |
| 26 | 19, 21, 21, 25 | syl3anc 1271 | . . 3 ⊢ (𝜑 → (((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆) ↔ (0g‘𝑆) = (0g‘𝑀))) |
| 27 | 18, 26 | mpbid 147 | . 2 ⊢ (𝜑 → (0g‘𝑆) = (0g‘𝑀)) |
| 28 | 27 | eqcomd 2235 | 1 ⊢ (𝜑 → (0g‘𝑀) = (0g‘𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ⊆ wss 3198 ‘cfv 5324 (class class class)co 6013 Basecbs 13075 +gcplusg 13153 0gc0g 13332 Grpcgrp 13576 |
| 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 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-cnex 8116 ax-resscn 8117 ax-1re 8119 ax-addrcl 8122 |
| 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-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-iota 5284 df-fun 5326 df-fn 5327 df-fv 5332 df-riota 5966 df-ov 6016 df-inn 9137 df-2 9195 df-ndx 13078 df-slot 13079 df-base 13081 df-plusg 13166 df-0g 13334 df-mgm 13432 df-sgrp 13478 df-mnd 13493 df-grp 13579 |
| This theorem is referenced by: grpinvssd 13653 |
| Copyright terms: Public domain | W3C validator |