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

Theorem subrg1 14512
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 2238 . . . . 5  |-  ( 1r
`  R )  =  ( 1r `  R
)
32subrg1cl 14510 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  R )  e.  A
)
4 subrg1.1 . . . . 5  |-  S  =  ( Rs  A )
54subrgbas 14511 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  A  =  ( Base `  S )
)
63, 5eleqtrd 2317 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  R )  e.  (
Base `  S )
)
7 eqid 2238 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
87subrgss 14503 . . . . . . 7  |-  ( A  e.  (SubRing `  R
)  ->  A  C_  ( Base `  R ) )
95, 8eqsstrrd 3285 . . . . . 6  |-  ( A  e.  (SubRing `  R
)  ->  ( Base `  S )  C_  ( Base `  R ) )
109sselda 3248 . . . . 5  |-  ( ( A  e.  (SubRing `  R
)  /\  x  e.  ( Base `  S )
)  ->  x  e.  ( Base `  R )
)
11 subrgrcl 14507 . . . . . . 7  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
12 eqid 2238 . . . . . . . 8  |-  ( .r
`  R )  =  ( .r `  R
)
137, 12, 2ringidmlem 14300 . . . . . . 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 13476 . . . . . . . . . . 11  |-  ( ( A  e.  (SubRing `  R
)  /\  R  e.  Ring )  ->  ( .r `  R )  =  ( .r `  S ) )
1611, 15mpdan 425 . . . . . . . . . 10  |-  ( A  e.  (SubRing `  R
)  ->  ( .r `  R )  =  ( .r `  S ) )
1716oveqd 6092 . . . . . . . . 9  |-  ( A  e.  (SubRing `  R
)  ->  ( ( 1r `  R ) ( .r `  R ) x )  =  ( ( 1r `  R
) ( .r `  S ) x ) )
1817eqeq1d 2247 . . . . . . . 8  |-  ( A  e.  (SubRing `  R
)  ->  ( (
( 1r `  R
) ( .r `  R ) x )  =  x  <->  ( ( 1r `  R ) ( .r `  S ) x )  =  x ) )
1916oveqd 6092 . . . . . . . . 9  |-  ( A  e.  (SubRing `  R
)  ->  ( x
( .r `  R
) ( 1r `  R ) )  =  ( x ( .r
`  S ) ( 1r `  R ) ) )
2019eqeq1d 2247 . . . . . . . 8  |-  ( A  e.  (SubRing `  R
)  ->  ( (
x ( .r `  R ) ( 1r
`  R ) )  =  x  <->  ( x
( .r `  S
) ( 1r `  R ) )  =  x ) )
2118, 20anbi12d 477 . . . . . . 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 2623 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  A. x  e.  ( Base `  S
) ( ( ( 1r `  R ) ( .r `  S
) x )  =  x  /\  ( x ( .r `  S
) ( 1r `  R ) )  =  x ) )
264subrgring 14505 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  S  e.  Ring )
27 eqid 2238 . . . . 5  |-  ( Base `  S )  =  (
Base `  S )
28 eqid 2238 . . . . 5  |-  ( .r
`  S )  =  ( .r `  S
)
29 eqid 2238 . . . . 5  |-  ( 1r
`  S )  =  ( 1r `  S
)
3027, 28, 29isringid 14303 . . . 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 956 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  S )  =  ( 1r `  R ) )
331, 32eqtr4id 2290 1  |-  ( A  e.  (SubRing `  R
)  ->  .1.  =  ( 1r `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   ` cfv 5372  (class class class)co 6075   Basecbs 13330   ↾s cress 13331   .rcmulr 13409   1rcur 14237   Ringcrg 14274  SubRingcsubrg 14498
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 623  ax-in2 624  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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  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-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-mulr 13422  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-subg 13950  df-mgp 14195  df-ur 14238  df-ring 14276  df-subrg 14500
This theorem is referenced by:  subrguss  14517  subrginv  14518  subrgunit  14520  subrgnzr  14523  subsubrg  14526  sralmod  14759  zring1  14908
  Copyright terms: Public domain W3C validator