ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  grpidssd GIF version

Theorem grpidssd 13682
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.)
Hypotheses
Ref Expression
grpidssd.m (𝜑𝑀 ∈ Grp)
grpidssd.s (𝜑𝑆 ∈ Grp)
grpidssd.b 𝐵 = (Base‘𝑆)
grpidssd.c (𝜑𝐵 ⊆ (Base‘𝑀))
grpidssd.o (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
Assertion
Ref Expression
grpidssd (𝜑 → (0g𝑀) = (0g𝑆))
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝑀,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem grpidssd
StepHypRef Expression
1 grpidssd.s . . . . . 6 (𝜑𝑆 ∈ Grp)
2 grpidssd.b . . . . . . 7 𝐵 = (Base‘𝑆)
3 eqid 2230 . . . . . . 7 (0g𝑆) = (0g𝑆)
42, 3grpidcl 13635 . . . . . 6 (𝑆 ∈ Grp → (0g𝑆) ∈ 𝐵)
51, 4syl 14 . . . . 5 (𝜑 → (0g𝑆) ∈ 𝐵)
6 grpidssd.o . . . . 5 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
7 oveq1 6030 . . . . . . 7 (𝑥 = (0g𝑆) → (𝑥(+g𝑀)𝑦) = ((0g𝑆)(+g𝑀)𝑦))
8 oveq1 6030 . . . . . . 7 (𝑥 = (0g𝑆) → (𝑥(+g𝑆)𝑦) = ((0g𝑆)(+g𝑆)𝑦))
97, 8eqeq12d 2245 . . . . . 6 (𝑥 = (0g𝑆) → ((𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦) ↔ ((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑆)𝑦)))
10 oveq2 6031 . . . . . . 7 (𝑦 = (0g𝑆) → ((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑀)(0g𝑆)))
11 oveq2 6031 . . . . . . 7 (𝑦 = (0g𝑆) → ((0g𝑆)(+g𝑆)𝑦) = ((0g𝑆)(+g𝑆)(0g𝑆)))
1210, 11eqeq12d 2245 . . . . . 6 (𝑦 = (0g𝑆) → (((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑆)𝑦) ↔ ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆))))
139, 12rspc2va 2923 . . . . 5 ((((0g𝑆) ∈ 𝐵 ∧ (0g𝑆) ∈ 𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦)) → ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆)))
145, 5, 6, 13syl21anc 1272 . . . 4 (𝜑 → ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆)))
15 eqid 2230 . . . . . 6 (+g𝑆) = (+g𝑆)
162, 15, 3grplid 13637 . . . . 5 ((𝑆 ∈ Grp ∧ (0g𝑆) ∈ 𝐵) → ((0g𝑆)(+g𝑆)(0g𝑆)) = (0g𝑆))
171, 4, 16syl2anc2 412 . . . 4 (𝜑 → ((0g𝑆)(+g𝑆)(0g𝑆)) = (0g𝑆))
1814, 17eqtrd 2263 . . 3 (𝜑 → ((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆))
19 grpidssd.m . . . 4 (𝜑𝑀 ∈ Grp)
20 grpidssd.c . . . . 5 (𝜑𝐵 ⊆ (Base‘𝑀))
2120, 5sseldd 3227 . . . 4 (𝜑 → (0g𝑆) ∈ (Base‘𝑀))
22 eqid 2230 . . . . 5 (Base‘𝑀) = (Base‘𝑀)
23 eqid 2230 . . . . 5 (+g𝑀) = (+g𝑀)
24 eqid 2230 . . . . 5 (0g𝑀) = (0g𝑀)
2522, 23, 24grpidlcan 13672 . . . 4 ((𝑀 ∈ Grp ∧ (0g𝑆) ∈ (Base‘𝑀) ∧ (0g𝑆) ∈ (Base‘𝑀)) → (((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆) ↔ (0g𝑆) = (0g𝑀)))
2619, 21, 21, 25syl3anc 1273 . . 3 (𝜑 → (((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆) ↔ (0g𝑆) = (0g𝑀)))
2718, 26mpbid 147 . 2 (𝜑 → (0g𝑆) = (0g𝑀))
2827eqcomd 2236 1 (𝜑 → (0g𝑀) = (0g𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1397  wcel 2201  wral 2509  wss 3199  cfv 5328  (class class class)co 6023  Basecbs 13105  +gcplusg 13183  0gc0g 13362  Grpcgrp 13606
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-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  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-riota 5976  df-ov 6026  df-inn 9149  df-2 9207  df-ndx 13108  df-slot 13109  df-base 13111  df-plusg 13196  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-grp 13609
This theorem is referenced by:  grpinvssd  13683
  Copyright terms: Public domain W3C validator