Theorem ringidss 14106

Description: A subset of the multiplicative group has the multiplicative identity as its identity if the identity is in the subset. (Contributed by Mario Carneiro, 27-Dec-2014.) (Revised by Mario Carneiro, 30-Apr-2015.)

Hypotheses

Ref	Expression
ringidss.g	|- M = ( (mulGrp ` R ) ↾s A )
ringidss.b	|- B = ( Base ` R )
ringidss.u	|- .1. = ( 1r ` R )

Assertion

Ref	Expression
ringidss	|- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> .1. = ( 0g ` M ) )

Proof of Theorem ringidss

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2231	. 2 |- ( Base ` M ) = ( Base ` M )
2		eqid 2231	. 2 |- ( 0g ` M ) = ( 0g ` M )
3		eqid 2231	. 2 |- ( +g ` M ) = ( +g ` M )
4		simp3 1026	. . 3 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> .1. e. A )
5		ringidss.g	. . . . 5 |- M = ( (mulGrp ` R ) ↾s A )
6	5	a1i 9	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> M = ( (mulGrp ` R ) ↾s A ) )
7		eqid 2231	. . . . . 6 |- (mulGrp ` R ) = (mulGrp ` R )
8		ringidss.b	. . . . . 6 |- B = ( Base ` R )
9	7, 8	mgpbasg 14003	. . . . 5 |- ( R e. Ring -> B = ( Base ` (mulGrp ` R ) ) )
10	9	3ad2ant1 1045	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> B = ( Base ` (mulGrp ` R ) ) )
11	7	mgpex 14002	. . . . 5 |- ( R e. Ring -> (mulGrp ` R ) e. _V )
12	11	3ad2ant1 1045	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> (mulGrp ` R ) e. _V )
13		simp2 1025	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> A C_ B )
14	6, 10, 12, 13	ressbas2d 13214	. . 3 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> A = ( Base ` M ) )
15	4, 14	eleqtrd 2310	. 2 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> .1. e. ( Base ` M ) )
16	14, 13	eqsstrrd 3265	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> ( Base ` M ) C_ B )
17	16	sselda 3228	. . 3 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. ( Base ` M ) ) -> y e. B )
18		eqid 2231	. . . . . . . . 9 |- ( .r ` R ) = ( .r ` R )
19	7, 18	mgpplusgg 14001	. . . . . . . 8 |- ( R e. Ring -> ( .r ` R ) = ( +g ` (mulGrp ` R ) ) )
20	19	3ad2ant1 1045	. . . . . . 7 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> ( .r ` R ) = ( +g ` (mulGrp ` R ) ) )
21		basfn 13204	. . . . . . . . . 10 |- Base Fn _V
22		simp1 1024	. . . . . . . . . . 11 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> R e. Ring )
23	22	elexd 2817	. . . . . . . . . 10 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> R e. _V )
24		funfvex 5665	. . . . . . . . . . 11 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
25	24	funfni 5439	. . . . . . . . . 10 |- ( ( Base Fn _V /\ R e. _V ) -> ( Base ` R ) e. _V )
26	21, 23, 25	sylancr 414	. . . . . . . . 9 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> ( Base ` R ) e. _V )
27	8, 26	eqeltrid 2318	. . . . . . . 8 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> B e. _V )
28	27, 13	ssexd 4234	. . . . . . 7 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> A e. _V )
29	6, 20, 28, 12	ressplusgd 13275	. . . . . 6 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> ( .r ` R ) = ( +g ` M ) )
30	29	adantr 276	. . . . 5 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( .r ` R ) = ( +g ` M ) )
31	30	oveqd 6045	. . . 4 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( .1. ( .r ` R ) y ) = ( .1. ( +g ` M ) y ) )
32		ringidss.u	. . . . . 6 |- .1. = ( 1r ` R )
33	8, 18, 32	ringlidm 14100	. . . . 5 |- ( ( R e. Ring /\ y e. B ) -> ( .1. ( .r ` R ) y ) = y )
34	33	3ad2antl1 1186	. . . 4 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( .1. ( .r ` R ) y ) = y )
35	31, 34	eqtr3d 2266	. . 3 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( .1. ( +g ` M ) y ) = y )
36	17, 35	syldan 282	. 2 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. ( Base ` M ) ) -> ( .1. ( +g ` M ) y ) = y )
37	30	oveqd 6045	. . . 4 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( y ( .r ` R ) .1. ) = ( y ( +g ` M ) .1. ) )
38	8, 18, 32	ringridm 14101	. . . . 5 |- ( ( R e. Ring /\ y e. B ) -> ( y ( .r ` R ) .1. ) = y )
39	38	3ad2antl1 1186	. . . 4 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( y ( .r ` R ) .1. ) = y )
40	37, 39	eqtr3d 2266	. . 3 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. B ) -> ( y ( +g ` M ) .1. ) = y )
41	17, 40	syldan 282	. 2 |- ( ( ( R e. Ring /\ A C_ B /\ .1. e. A ) /\ y e. ( Base ` M ) ) -> ( y ( +g ` M ) .1. ) = y )
42	1, 2, 3, 15, 36, 41	ismgmid2 13526	1 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> .1. = ( 0g ` M ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2202   _Vcvv 2803   C_ wss 3201   Fn wfn 5328   ` cfv 5333  (class class class)co 6028   Basecbs 13145   ↾_s cress 13146   +g cplusg 13223   .rcmulr 13224   0gc0g 13402  mulGrpcmgp 13997   1rcur 14036   Ringcrg 14073

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-in1 619  ax-in2 620  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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-ltadd 8191

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-mulr 13237  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-mgp 13998  df-ur 14037  df-ring 14075

This theorem is referenced by:  unitgrpid  14196