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

Theorem subrg1 13357
Description: A subring always has the same multiplicative identity. (Contributed by Stefan O'Rear, 27-Nov-2014.)
Hypotheses
Ref Expression
subrg1.1  |-  S  =  ( Rs  A )
subrg1.2  |-  .1.  =  ( 1r `  R )
Assertion
Ref Expression
subrg1  |-  ( A  e.  (SubRing `  R
)  ->  .1.  =  ( 1r `  S ) )

Proof of Theorem subrg1
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 subrg1.2 . 2  |-  .1.  =  ( 1r `  R )
2 eqid 2177 . . . . 5  |-  ( 1r
`  R )  =  ( 1r `  R
)
32subrg1cl 13355 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  R )  e.  A
)
4 subrg1.1 . . . . 5  |-  S  =  ( Rs  A )
54subrgbas 13356 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  A  =  ( Base `  S )
)
63, 5eleqtrd 2256 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  R )  e.  (
Base `  S )
)
7 eqid 2177 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
87subrgss 13348 . . . . . . 7  |-  ( A  e.  (SubRing `  R
)  ->  A  C_  ( Base `  R ) )
95, 8eqsstrrd 3194 . . . . . 6  |-  ( A  e.  (SubRing `  R
)  ->  ( Base `  S )  C_  ( Base `  R ) )
109sselda 3157 . . . . 5  |-  ( ( A  e.  (SubRing `  R
)  /\  x  e.  ( Base `  S )
)  ->  x  e.  ( Base `  R )
)
11 subrgrcl 13352 . . . . . . 7  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
12 eqid 2177 . . . . . . . 8  |-  ( .r
`  R )  =  ( .r `  R
)
137, 12, 2ringidmlem 13210 . . . . . . 7  |-  ( ( R  e.  Ring  /\  x  e.  ( Base `  R
) )  ->  (
( ( 1r `  R ) ( .r
`  R ) x )  =  x  /\  ( x ( .r
`  R ) ( 1r `  R ) )  =  x ) )
1411, 13sylan 283 . . . . . 6  |-  ( ( A  e.  (SubRing `  R
)  /\  x  e.  ( Base `  R )
)  ->  ( (
( 1r `  R
) ( .r `  R ) x )  =  x  /\  (
x ( .r `  R ) ( 1r
`  R ) )  =  x ) )
154, 12ressmulrg 12605 . . . . . . . . . . 11  |-  ( ( A  e.  (SubRing `  R
)  /\  R  e.  Ring )  ->  ( .r `  R )  =  ( .r `  S ) )
1611, 15mpdan 421 . . . . . . . . . 10  |-  ( A  e.  (SubRing `  R
)  ->  ( .r `  R )  =  ( .r `  S ) )
1716oveqd 5894 . . . . . . . . 9  |-  ( A  e.  (SubRing `  R
)  ->  ( ( 1r `  R ) ( .r `  R ) x )  =  ( ( 1r `  R
) ( .r `  S ) x ) )
1817eqeq1d 2186 . . . . . . . 8  |-  ( A  e.  (SubRing `  R
)  ->  ( (
( 1r `  R
) ( .r `  R ) x )  =  x  <->  ( ( 1r `  R ) ( .r `  S ) x )  =  x ) )
1916oveqd 5894 . . . . . . . . 9  |-  ( A  e.  (SubRing `  R
)  ->  ( x
( .r `  R
) ( 1r `  R ) )  =  ( x ( .r
`  S ) ( 1r `  R ) ) )
2019eqeq1d 2186 . . . . . . . 8  |-  ( A  e.  (SubRing `  R
)  ->  ( (
x ( .r `  R ) ( 1r
`  R ) )  =  x  <->  ( x
( .r `  S
) ( 1r `  R ) )  =  x ) )
2118, 20anbi12d 473 . . . . . . 7  |-  ( A  e.  (SubRing `  R
)  ->  ( (
( ( 1r `  R ) ( .r
`  R ) x )  =  x  /\  ( x ( .r
`  R ) ( 1r `  R ) )  =  x )  <-> 
( ( ( 1r
`  R ) ( .r `  S ) x )  =  x  /\  ( x ( .r `  S ) ( 1r `  R
) )  =  x ) ) )
2221biimpa 296 . . . . . 6  |-  ( ( A  e.  (SubRing `  R
)  /\  ( (
( 1r `  R
) ( .r `  R ) x )  =  x  /\  (
x ( .r `  R ) ( 1r
`  R ) )  =  x ) )  ->  ( ( ( 1r `  R ) ( .r `  S
) x )  =  x  /\  ( x ( .r `  S
) ( 1r `  R ) )  =  x ) )
2314, 22syldan 282 . . . . 5  |-  ( ( A  e.  (SubRing `  R
)  /\  x  e.  ( Base `  R )
)  ->  ( (
( 1r `  R
) ( .r `  S ) x )  =  x  /\  (
x ( .r `  S ) ( 1r
`  R ) )  =  x ) )
2410, 23syldan 282 . . . 4  |-  ( ( A  e.  (SubRing `  R
)  /\  x  e.  ( Base `  S )
)  ->  ( (
( 1r `  R
) ( .r `  S ) x )  =  x  /\  (
x ( .r `  S ) ( 1r
`  R ) )  =  x ) )
2524ralrimiva 2550 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  A. x  e.  ( Base `  S
) ( ( ( 1r `  R ) ( .r `  S
) x )  =  x  /\  ( x ( .r `  S
) ( 1r `  R ) )  =  x ) )
264subrgring 13350 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  S  e.  Ring )
27 eqid 2177 . . . . 5  |-  ( Base `  S )  =  (
Base `  S )
28 eqid 2177 . . . . 5  |-  ( .r
`  S )  =  ( .r `  S
)
29 eqid 2177 . . . . 5  |-  ( 1r
`  S )  =  ( 1r `  S
)
3027, 28, 29isringid 13213 . . . 4  |-  ( S  e.  Ring  ->  ( ( ( 1r `  R
)  e.  ( Base `  S )  /\  A. x  e.  ( Base `  S ) ( ( ( 1r `  R
) ( .r `  S ) x )  =  x  /\  (
x ( .r `  S ) ( 1r
`  R ) )  =  x ) )  <-> 
( 1r `  S
)  =  ( 1r
`  R ) ) )
3126, 30syl 14 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( (
( 1r `  R
)  e.  ( Base `  S )  /\  A. x  e.  ( Base `  S ) ( ( ( 1r `  R
) ( .r `  S ) x )  =  x  /\  (
x ( .r `  S ) ( 1r
`  R ) )  =  x ) )  <-> 
( 1r `  S
)  =  ( 1r
`  R ) ) )
326, 25, 31mpbi2and 943 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  S )  =  ( 1r `  R ) )
331, 32eqtr4id 2229 1  |-  ( A  e.  (SubRing `  R
)  ->  .1.  =  ( 1r `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2148   A.wral 2455   ` cfv 5218  (class class class)co 5877   Basecbs 12464   ↾s cress 12465   .rcmulr 12539   1rcur 13147   Ringcrg 13184  SubRingcsubrg 13343
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-pre-ltirr 7925  ax-pre-lttrn 7927  ax-pre-ltadd 7929
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-ltxr 7999  df-inn 8922  df-2 8980  df-3 8981  df-ndx 12467  df-slot 12468  df-base 12470  df-sets 12471  df-iress 12472  df-plusg 12551  df-mulr 12552  df-0g 12712  df-mgm 12780  df-sgrp 12813  df-mnd 12823  df-subg 13035  df-mgp 13136  df-ur 13148  df-ring 13186  df-subrg 13345
This theorem is referenced by:  subrguss  13362  subrginv  13363  subrgunit  13365  subrgnzr  13368  subsubrg  13371  zring1  13576
  Copyright terms: Public domain W3C validator