| 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 2231 | . . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 4 | 2, 3 | grpidcl 13614 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝐵) |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (0g‘𝑆) ∈ 𝐵) |
| 6 | grpidssd.o | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) | |
| 7 | oveq1 6025 | . . . . . . 7 ⊢ (𝑥 = (0g‘𝑆) → (𝑥(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑀)𝑦)) | |
| 8 | oveq1 6025 | . . . . . . 7 ⊢ (𝑥 = (0g‘𝑆) → (𝑥(+g‘𝑆)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦)) | |
| 9 | 7, 8 | eqeq12d 2246 | . . . . . 6 ⊢ (𝑥 = (0g‘𝑆) → ((𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦) ↔ ((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦))) |
| 10 | oveq2 6026 | . . . . . . 7 ⊢ (𝑦 = (0g‘𝑆) → ((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆))) | |
| 11 | oveq2 6026 | . . . . . . 7 ⊢ (𝑦 = (0g‘𝑆) → ((0g‘𝑆)(+g‘𝑆)𝑦) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) | |
| 12 | 10, 11 | eqeq12d 2246 | . . . . . 6 ⊢ (𝑦 = (0g‘𝑆) → (((0g‘𝑆)(+g‘𝑀)𝑦) = ((0g‘𝑆)(+g‘𝑆)𝑦) ↔ ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)))) |
| 13 | 9, 12 | rspc2va 2924 | . . . . 5 ⊢ ((((0g‘𝑆) ∈ 𝐵 ∧ (0g‘𝑆) ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑆)𝑦)) → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) |
| 14 | 5, 5, 6, 13 | syl21anc 1272 | . . . 4 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆))) |
| 15 | eqid 2231 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 16 | 2, 15, 3 | grplid 13616 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (0g‘𝑆) ∈ 𝐵) → ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)) = (0g‘𝑆)) |
| 17 | 1, 4, 16 | syl2anc2 412 | . . . 4 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑆)(0g‘𝑆)) = (0g‘𝑆)) |
| 18 | 14, 17 | eqtrd 2264 | . . 3 ⊢ (𝜑 → ((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆)) |
| 19 | grpidssd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ Grp) | |
| 20 | grpidssd.c | . . . . 5 ⊢ (𝜑 → 𝐵 ⊆ (Base‘𝑀)) | |
| 21 | 20, 5 | sseldd 3228 | . . . 4 ⊢ (𝜑 → (0g‘𝑆) ∈ (Base‘𝑀)) |
| 22 | eqid 2231 | . . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 23 | eqid 2231 | . . . . 5 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 24 | eqid 2231 | . . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 25 | 22, 23, 24 | grpidlcan 13651 | . . . 4 ⊢ ((𝑀 ∈ Grp ∧ (0g‘𝑆) ∈ (Base‘𝑀) ∧ (0g‘𝑆) ∈ (Base‘𝑀)) → (((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆) ↔ (0g‘𝑆) = (0g‘𝑀))) |
| 26 | 19, 21, 21, 25 | syl3anc 1273 | . . 3 ⊢ (𝜑 → (((0g‘𝑆)(+g‘𝑀)(0g‘𝑆)) = (0g‘𝑆) ↔ (0g‘𝑆) = (0g‘𝑀))) |
| 27 | 18, 26 | mpbid 147 | . 2 ⊢ (𝜑 → (0g‘𝑆) = (0g‘𝑀)) |
| 28 | 27 | eqcomd 2237 | 1 ⊢ (𝜑 → (0g‘𝑀) = (0g‘𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ∀wral 2510 ⊆ wss 3200 ‘cfv 5326 (class class class)co 6018 Basecbs 13084 +gcplusg 13162 0gc0g 13341 Grpcgrp 13585 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 df-riota 5971 df-ov 6021 df-inn 9144 df-2 9202 df-ndx 13087 df-slot 13088 df-base 13090 df-plusg 13175 df-0g 13343 df-mgm 13441 df-sgrp 13487 df-mnd 13502 df-grp 13588 |
| This theorem is referenced by: grpinvssd 13662 |
| Copyright terms: Public domain | W3C validator |