Theorem grpidssd 13940

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 2238	. . . . . . 7 |- ( 0g ` S ) = ( 0g ` S )
4	2, 3	grpidcl 13893	. . . . . 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 6095	. . . . . . 7 |- ( x = ( 0g ` S ) -> ( x ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` M ) y ) )
8		oveq1 6095	. . . . . . 7 |- ( x = ( 0g ` S ) -> ( x ( +g ` S ) y ) = ( ( 0g ` S ) ( +g ` S ) y ) )
9	7, 8	eqeq12d 2253	. . . . . 6 |- ( x = ( 0g ` S ) -> ( ( x ( +g ` M ) y ) = ( x ( +g ` S ) y ) <-> ( ( 0g ` S ) ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` S ) y ) ) )
10		oveq2 6096	. . . . . . 7 |- ( y = ( 0g ` S ) -> ( ( 0g ` S ) ( +g ` M ) y ) = ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) )
11		oveq2 6096	. . . . . . 7 |- ( y = ( 0g ` S ) -> ( ( 0g ` S ) ( +g ` S ) y ) = ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) )
12	10, 11	eqeq12d 2253	. . . . . 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 2944	. . . . 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 1277	. . . 4 |- ( ph -> ( ( 0g ` S ) ( +g ` M ) ( 0g ` S ) ) = ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) )
15		eqid 2238	. . . . . 6 |- ( +g ` S ) = ( +g ` S )
16	2, 15, 3	grplid 13895	. . . . 5 |- ( ( S e. Grp /\ ( 0g ` S ) e. B ) -> ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) = ( 0g ` S ) )
17	1, 4, 16	syl2anc2 416	. . . 4 |- ( ph -> ( ( 0g ` S ) ( +g ` S ) ( 0g ` S ) ) = ( 0g ` S ) )
18	14, 17	eqtrd 2271	. . 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 3249	. . . 4 |- ( ph -> ( 0g ` S ) e. ( Base ` M ) )
22		eqid 2238	. . . . 5 |- ( Base ` M ) = ( Base ` M )
23		eqid 2238	. . . . 5 |- ( +g ` M ) = ( +g ` M )
24		eqid 2238	. . . . 5 |- ( 0g ` M ) = ( 0g ` M )
25	22, 23, 24	grpidlcan 13930	. . . 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 1278	. . 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 2244	1 |- ( ph -> ( 0g ` M ) = ( 0g ` S ) )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   C_ wss 3220   ` cfv 5380  (class class class)co 6088   Basecbs 13410   +g cplusg 13490   0gc0g 13669   Grpcgrp 13864

This proof depends on 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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282

This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fn 5383  df-fv 5388  df-riota 6041  df-ov 6091  df-inn 9314  df-2 9372  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867

This theorem is used by:  grpinvssd  13941