Theorem ringidss 14041

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 1025	. . 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 13938	. . . . 5 |- ( R e. Ring -> B = ( Base ` (mulGrp ` R ) ) )
10	9	3ad2ant1 1044	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> B = ( Base ` (mulGrp ` R ) ) )
11	7	mgpex 13937	. . . . 5 |- ( R e. Ring -> (mulGrp ` R ) e. _V )
12	11	3ad2ant1 1044	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> (mulGrp ` R ) e. _V )
13		simp2 1024	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> A C_ B )
14	6, 10, 12, 13	ressbas2d 13150	. . 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 3264	. . . 4 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> ( Base ` M ) C_ B )
17	16	sselda 3227	. . 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 13936	. . . . . . . 8 |- ( R e. Ring -> ( .r ` R ) = ( +g ` (mulGrp ` R ) ) )
20	19	3ad2ant1 1044	. . . . . . 7 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> ( .r ` R ) = ( +g ` (mulGrp ` R ) ) )
21		basfn 13140	. . . . . . . . . 10 |- Base Fn _V
22		simp1 1023	. . . . . . . . . . 11 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> R e. Ring )
23	22	elexd 2816	. . . . . . . . . 10 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> R e. _V )
24		funfvex 5656	. . . . . . . . . . 11 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
25	24	funfni 5432	. . . . . . . . . 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 4229	. . . . . . 7 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> A e. _V )
29	6, 20, 28, 12	ressplusgd 13211	. . . . . 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 6034	. . . 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 14035	. . . . 5 |- ( ( R e. Ring /\ y e. B ) -> ( .1. ( .r ` R ) y ) = y )
34	33	3ad2antl1 1185	. . . 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 6034	. . . 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 14036	. . . . 5 |- ( ( R e. Ring /\ y e. B ) -> ( y ( .r ` R ) .1. ) = y )
39	38	3ad2antl1 1185	. . . 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 13462	1 |- ( ( R e. Ring /\ A C_ B /\ .1. e. A ) -> .1. = ( 0g ` M ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   _Vcvv 2802   C_ wss 3200   Fn wfn 5321   ` cfv 5326  (class class class)co 6017   Basecbs 13081   ↾_s cress 13082   +g cplusg 13159   .rcmulr 13160   0gc0g 13338  mulGrpcmgp 13932   1rcur 13971   Ringcrg 14008

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-iress 13089  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-mgp 13933  df-ur 13972  df-ring 14010

This theorem is referenced by:  unitgrpid  14131