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

Theorem grpidssd 13864
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 2238 . . . . . . 7 (0g𝑆) = (0g𝑆)
42, 3grpidcl 13817 . . . . . 6 (𝑆 ∈ Grp → (0g𝑆) ∈ 𝐵)
51, 4syl 14 . . . . 5 (𝜑 → (0g𝑆) ∈ 𝐵)
6 grpidssd.o . . . . 5 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
7 oveq1 6086 . . . . . . 7 (𝑥 = (0g𝑆) → (𝑥(+g𝑀)𝑦) = ((0g𝑆)(+g𝑀)𝑦))
8 oveq1 6086 . . . . . . 7 (𝑥 = (0g𝑆) → (𝑥(+g𝑆)𝑦) = ((0g𝑆)(+g𝑆)𝑦))
97, 8eqeq12d 2253 . . . . . 6 (𝑥 = (0g𝑆) → ((𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦) ↔ ((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑆)𝑦)))
10 oveq2 6087 . . . . . . 7 (𝑦 = (0g𝑆) → ((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑀)(0g𝑆)))
11 oveq2 6087 . . . . . . 7 (𝑦 = (0g𝑆) → ((0g𝑆)(+g𝑆)𝑦) = ((0g𝑆)(+g𝑆)(0g𝑆)))
1210, 11eqeq12d 2253 . . . . . 6 (𝑦 = (0g𝑆) → (((0g𝑆)(+g𝑀)𝑦) = ((0g𝑆)(+g𝑆)𝑦) ↔ ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆))))
139, 12rspc2va 2944 . . . . 5 ((((0g𝑆) ∈ 𝐵 ∧ (0g𝑆) ∈ 𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦)) → ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆)))
145, 5, 6, 13syl21anc 1277 . . . 4 (𝜑 → ((0g𝑆)(+g𝑀)(0g𝑆)) = ((0g𝑆)(+g𝑆)(0g𝑆)))
15 eqid 2238 . . . . . 6 (+g𝑆) = (+g𝑆)
162, 15, 3grplid 13819 . . . . 5 ((𝑆 ∈ Grp ∧ (0g𝑆) ∈ 𝐵) → ((0g𝑆)(+g𝑆)(0g𝑆)) = (0g𝑆))
171, 4, 16syl2anc2 416 . . . 4 (𝜑 → ((0g𝑆)(+g𝑆)(0g𝑆)) = (0g𝑆))
1814, 17eqtrd 2271 . . 3 (𝜑 → ((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆))
19 grpidssd.m . . . 4 (𝜑𝑀 ∈ Grp)
20 grpidssd.c . . . . 5 (𝜑𝐵 ⊆ (Base‘𝑀))
2120, 5sseldd 3249 . . . 4 (𝜑 → (0g𝑆) ∈ (Base‘𝑀))
22 eqid 2238 . . . . 5 (Base‘𝑀) = (Base‘𝑀)
23 eqid 2238 . . . . 5 (+g𝑀) = (+g𝑀)
24 eqid 2238 . . . . 5 (0g𝑀) = (0g𝑀)
2522, 23, 24grpidlcan 13854 . . . 4 ((𝑀 ∈ Grp ∧ (0g𝑆) ∈ (Base‘𝑀) ∧ (0g𝑆) ∈ (Base‘𝑀)) → (((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆) ↔ (0g𝑆) = (0g𝑀)))
2619, 21, 21, 25syl3anc 1278 . . 3 (𝜑 → (((0g𝑆)(+g𝑀)(0g𝑆)) = (0g𝑆) ↔ (0g𝑆) = (0g𝑀)))
2718, 26mpbid 147 . 2 (𝜑 → (0g𝑆) = (0g𝑀))
2827eqcomd 2244 1 (𝜑 → (0g𝑀) = (0g𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1402  wcel 2209  wral 2528  wss 3220  cfv 5375  (class class class)co 6079  Basecbs 13335  +gcplusg 13414  0gc0g 13593  Grpcgrp 13788
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-cnex 8264  ax-resscn 8265  ax-1re 8267  ax-addrcl 8270
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-iota 5335  df-fun 5377  df-fn 5378  df-fv 5383  df-riota 6032  df-ov 6082  df-inn 9288  df-2 9346  df-ndx 13338  df-slot 13339  df-base 13341  df-plusg 13427  df-0g 13595  df-mgm 13659  df-sgrp 13700  df-mnd 13713  df-grp 13791
This theorem is referenced by:  grpinvssd  13865
  Copyright terms: Public domain W3C validator