Theorem grpidssd 13408

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	|- ( ph -> M e. Grp )
grpidssd.s	|- ( ph -> S e. Grp )
grpidssd.b	|- B = ( Base ` S )
grpidssd.c	|- ( ph -> B C_ ( Base ` M ) )
grpidssd.o	|- ( ph -> A. x e. B A. y e. B ( x ( +g ` M ) y ) = ( x ( +g ` S ) y ) )

Assertion

Ref	Expression
grpidssd	|- ( ph -> ( 0g ` M ) = ( 0g ` S ) )

Distinct variable groups:   x, B, y   x, M, y   x, S, y

Allowed substitution hints:   ph( x, y)

Proof of Theorem grpidssd

Step	Hyp	Ref	Expression
1		grpidssd.s	. . . . . 6 |- ( ph -> S e. Grp )
2		grpidssd.b	. . . . . . 7 |- B = ( Base ` S )
3		eqid 2205	. . . . . . 7 |- ( 0g ` S ) = ( 0g ` S )
4	2, 3	grpidcl 13361	. . . . . 6 |- ( S e. Grp -> ( 0g ` S ) e. B )
5	1, 4	syl 14	. . . . 5 |- ( ph -> ( 0g ` S ) e. B )
6		grpidssd.o	. . . . 5 |- ( ph -> A. x e. B A. y e. B ( x ( +g ` M ) y ) = ( x ( +g ` S ) y ) )
7		oveq1 5951	. . . . . . 7 |- ( x = ( 0g ` S ) -> ( x ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` M ) y ) )
8		oveq1 5951	. . . . . . 7 |- ( x = ( 0g ` S ) -> ( x ( +g ` S ) y ) = ( ( 0g ` S ) ( +g ` S ) y ) )
9	7, 8	eqeq12d 2220	. . . . . 6 |- ( x = ( 0g ` S ) -> ( ( x ( +g ` M ) y ) = ( x ( +g ` S ) y ) <-> ( ( 0g ` S ) ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` S ) y ) ) )
10		oveq2 5952	. . . . . . 7 |- ( y = ( 0g ` S ) -> ( ( 0g ` S ) ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) )
11		oveq2 5952	. . . . . . 7 |- ( y = ( 0g ` S ) -> ( ( 0g ` S ) ( +g ` S ) y ) = ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) )
12	10, 11	eqeq12d 2220	. . . . . 6 |- ( y = ( 0g ` S ) -> ( ( ( 0g ` S ) ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` S ) y ) <-> ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) ) )
13	9, 12	rspc2va 2891	. . . . 5 |- ( ( ( ( 0g ` S ) e. B /\ ( 0g ` S ) e. B ) /\ A. x e. B A. y e. B ( x ( +g ` M ) y ) = ( x ( +g ` S ) y ) ) -> ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) )
14	5, 5, 6, 13	syl21anc 1249	. . . 4 |- ( ph -> ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) )
15		eqid 2205	. . . . . 6 |- ( +g ` S ) = ( +g ` S )
16	2, 15, 3	grplid 13363	. . . . 5 |- ( ( S e. Grp /\ ( 0g ` S ) e. B ) -> ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) = ( 0g ` S ) )
17	1, 4, 16	syl2anc2 412	. . . 4 |- ( ph -> ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) = ( 0g ` S ) )
18	14, 17	eqtrd 2238	. . 3 |- ( ph -> ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( 0g ` S ) )
19		grpidssd.m	. . . 4 |- ( ph -> M e. Grp )
20		grpidssd.c	. . . . 5 |- ( ph -> B C_ ( Base ` M ) )
21	20, 5	sseldd 3194	. . . 4 |- ( ph -> ( 0g ` S ) e. ( Base ` M ) )
22		eqid 2205	. . . . 5 |- ( Base ` M ) = ( Base ` M )
23		eqid 2205	. . . . 5 |- ( +g ` M ) = ( +g ` M )
24		eqid 2205	. . . . 5 |- ( 0g ` M ) = ( 0g ` M )
25	22, 23, 24	grpidlcan 13398	. . . 4 |- ( ( M e. Grp /\ ( 0g ` S ) e. ( Base ` M ) /\ ( 0g ` S ) e. ( Base ` M ) ) -> ( ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( 0g ` S ) <-> ( 0g ` S ) = ( 0g ` M ) ) )
26	19, 21, 21, 25	syl3anc 1250	. . 3 |- ( ph -> ( ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( 0g ` S ) <-> ( 0g ` S ) = ( 0g ` M ) ) )
27	18, 26	mpbid 147	. 2 |- ( ph -> ( 0g ` S ) = ( 0g ` M ) )
28	27	eqcomd 2211	1 |- ( ph -> ( 0g ` M ) = ( 0g ` S ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1373   e. wcel 2176   A.wral 2484   C_ wss 3166   ` cfv 5271  (class class class)co 5944   Basecbs 12832   +g cplusg 12909   0gc0g 13088   Grpcgrp 13332

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-cnex 8016  ax-resscn 8017  ax-1re 8019  ax-addrcl 8022

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279  df-riota 5899  df-ov 5947  df-inn 9037  df-2 9095  df-ndx 12835  df-slot 12836  df-base 12838  df-plusg 12922  df-0g 13090  df-mgm 13188  df-sgrp 13234  df-mnd 13249  df-grp 13335

This theorem is referenced by:  grpinvssd  13409