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

Theorem grpidssd 13778
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 2232 . . . . . . 7 (0g𝑆) = (0g𝑆)
42, 3grpidcl 13731 . . . . . 6 (𝑆 ∈ Grp → (0g𝑆) ∈ 𝐵)
51, 4syl 14 . . . . 5 (𝜑 → (0g𝑆) ∈ 𝐵)
6 grpidssd.o . . . . 5 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
7 oveq1 6056 . . . . . . 7 (𝑥 = (0g𝑆) → (𝑥(+g𝑀)𝑦) = ((0g𝑆)(+g𝑀)𝑦))
8 oveq1 6056 . . . . . . 7 (𝑥 = (0g𝑆) → (𝑥(+g𝑆)𝑦) = ((0g𝑆)(+g𝑆)𝑦))
97, 8eqeq12d 2247 . . . . . 6 (𝑥 = (0g𝑆) → ((𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦) ↔ ((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑆)𝑦)))
10 oveq2 6057 . . . . . . 7 (𝑦 = (0g𝑆) → ((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑀)(0g𝑆)))
11 oveq2 6057 . . . . . . 7 (𝑦 = (0g𝑆) → ((0g𝑆)(+g𝑆)𝑦) = ((0g𝑆)(+g𝑆)(0g𝑆)))
1210, 11eqeq12d 2247 . . . . . 6 (𝑦 = (0g𝑆) → (((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑆)𝑦) ↔ ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆))))
139, 12rspc2va 2934 . . . . 5 ((((0g𝑆) ∈ 𝐵 ∧ (0g𝑆) ∈ 𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦)) → ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆)))
145, 5, 6, 13syl21anc 1273 . . . 4 (𝜑 → ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆)))
15 eqid 2232 . . . . . 6 (+g𝑆) = (+g𝑆)
162, 15, 3grplid 13733 . . . . 5 ((𝑆 ∈ Grp ∧ (0g𝑆) ∈ 𝐵) → ((0g𝑆)(+g𝑆)(0g𝑆)) = (0g𝑆))
171, 4, 16syl2anc2 412 . . . 4 (𝜑 → ((0g𝑆)(+g𝑆)(0g𝑆)) = (0g𝑆))
1814, 17eqtrd 2265 . . 3 (𝜑 → ((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆))
19 grpidssd.m . . . 4 (𝜑𝑀 ∈ Grp)
20 grpidssd.c . . . . 5 (𝜑𝐵 ⊆ (Base‘𝑀))
2120, 5sseldd 3238 . . . 4 (𝜑 → (0g𝑆) ∈ (Base‘𝑀))
22 eqid 2232 . . . . 5 (Base‘𝑀) = (Base‘𝑀)
23 eqid 2232 . . . . 5 (+g𝑀) = (+g𝑀)
24 eqid 2232 . . . . 5 (0g𝑀) = (0g𝑀)
2522, 23, 24grpidlcan 13768 . . . 4 ((𝑀 ∈ Grp ∧ (0g𝑆) ∈ (Base‘𝑀) ∧ (0g𝑆) ∈ (Base‘𝑀)) → (((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆) ↔ (0g𝑆) = (0g𝑀)))
2619, 21, 21, 25syl3anc 1274 . . 3 (𝜑 → (((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆) ↔ (0g𝑆) = (0g𝑀)))
2718, 26mpbid 147 . 2 (𝜑 → (0g𝑆) = (0g𝑀))
2827eqcomd 2238 1 (𝜑 → (0g𝑀) = (0g𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1398  wcel 2203  wral 2520  wss 3210  cfv 5351  (class class class)co 6049  Basecbs 13201  +gcplusg 13279  0gc0g 13458  Grpcgrp 13702
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-cnex 8214  ax-resscn 8215  ax-1re 8217  ax-addrcl 8220
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fn 5354  df-fv 5359  df-riota 6002  df-ov 6052  df-inn 9234  df-2 9292  df-ndx 13204  df-slot 13205  df-base 13207  df-plusg 13292  df-0g 13460  df-mgm 13558  df-sgrp 13604  df-mnd 13619  df-grp 13705
This theorem is referenced by:  grpinvssd  13779
  Copyright terms: Public domain W3C validator