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

Theorem ringressid 14075
Description: A ring restricted to its base set is a ring. It will usually be the original ring exactly, of course, but to show that needs additional conditions such as those in strressid 13153. (Contributed by Jim Kingdon, 28-Feb-2025.)
Hypothesis
Ref Expression
ringressid.b  |-  B  =  ( Base `  G
)
Assertion
Ref Expression
ringressid  |-  ( G  e.  Ring  ->  ( Gs  B )  e.  Ring )

Proof of Theorem ringressid
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2232 . . 3  |-  ( G  e.  Ring  ->  ( Gs  B )  =  ( Gs  B ) )
2 ringressid.b . . . 4  |-  B  =  ( Base `  G
)
32a1i 9 . . 3  |-  ( G  e.  Ring  ->  B  =  ( Base `  G
) )
4 id 19 . . 3  |-  ( G  e.  Ring  ->  G  e. 
Ring )
5 ssidd 3248 . . 3  |-  ( G  e.  Ring  ->  B  C_  B )
61, 3, 4, 5ressbas2d 13150 . 2  |-  ( G  e.  Ring  ->  B  =  ( Base `  ( Gs  B ) ) )
7 eqidd 2232 . . 3  |-  ( G  e.  Ring  ->  ( +g  `  G )  =  ( +g  `  G ) )
8 basfn 13140 . . . . 5  |-  Base  Fn  _V
9 elex 2814 . . . . 5  |-  ( G  e.  Ring  ->  G  e. 
_V )
10 funfvex 5656 . . . . . 6  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
1110funfni 5432 . . . . 5  |-  ( (
Base  Fn  _V  /\  G  e.  _V )  ->  ( Base `  G )  e. 
_V )
128, 9, 11sylancr 414 . . . 4  |-  ( G  e.  Ring  ->  ( Base `  G )  e.  _V )
132, 12eqeltrid 2318 . . 3  |-  ( G  e.  Ring  ->  B  e. 
_V )
141, 7, 13, 4ressplusgd 13211 . 2  |-  ( G  e.  Ring  ->  ( +g  `  G )  =  ( +g  `  ( Gs  B ) ) )
15 eqid 2231 . . . 4  |-  ( Gs  B )  =  ( Gs  B )
16 eqid 2231 . . . 4  |-  ( .r
`  G )  =  ( .r `  G
)
1715, 16ressmulrg 13227 . . 3  |-  ( ( B  e.  _V  /\  G  e.  Ring )  -> 
( .r `  G
)  =  ( .r
`  ( Gs  B ) ) )
1813, 17mpancom 422 . 2  |-  ( G  e.  Ring  ->  ( .r
`  G )  =  ( .r `  ( Gs  B ) ) )
19 ringgrp 14013 . . 3  |-  ( G  e.  Ring  ->  G  e. 
Grp )
202grpressid 13643 . . 3  |-  ( G  e.  Grp  ->  ( Gs  B )  e.  Grp )
2119, 20syl 14 . 2  |-  ( G  e.  Ring  ->  ( Gs  B )  e.  Grp )
222, 16ringcl 14025 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B  /\  y  e.  B )  ->  (
x ( .r `  G ) y )  e.  B )
232, 16ringass 14028 . 2  |-  ( ( G  e.  Ring  /\  (
x  e.  B  /\  y  e.  B  /\  z  e.  B )
)  ->  ( (
x ( .r `  G ) y ) ( .r `  G
) z )  =  ( x ( .r
`  G ) ( y ( .r `  G ) z ) ) )
24 eqid 2231 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
252, 24, 16ringdi 14030 . 2  |-  ( ( G  e.  Ring  /\  (
x  e.  B  /\  y  e.  B  /\  z  e.  B )
)  ->  ( x
( .r `  G
) ( y ( +g  `  G ) z ) )  =  ( ( x ( .r `  G ) y ) ( +g  `  G ) ( x ( .r `  G
) z ) ) )
262, 24, 16ringdir 14031 . 2  |-  ( ( G  e.  Ring  /\  (
x  e.  B  /\  y  e.  B  /\  z  e.  B )
)  ->  ( (
x ( +g  `  G
) y ) ( .r `  G ) z )  =  ( ( x ( .r
`  G ) z ) ( +g  `  G
) ( y ( .r `  G ) z ) ) )
27 eqid 2231 . . 3  |-  ( 1r
`  G )  =  ( 1r `  G
)
282, 27ringidcl 14032 . 2  |-  ( G  e.  Ring  ->  ( 1r
`  G )  e.  B )
292, 16, 27ringlidm 14035 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B )  ->  (
( 1r `  G
) ( .r `  G ) x )  =  x )
302, 16, 27ringridm 14036 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B )  ->  (
x ( .r `  G ) ( 1r
`  G ) )  =  x )
316, 14, 18, 21, 22, 23, 25, 26, 28, 29, 30isringd 14053 1  |-  ( G  e.  Ring  ->  ( Gs  B )  e.  Ring )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   _Vcvv 2802    Fn wfn 5321   ` cfv 5326  (class class class)co 6017   Basecbs 13081   ↾s cress 13082   +g cplusg 13159   .rcmulr 13160   Grpcgrp 13582   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-coll 4204  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-lttrn 8145  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-iun 3972  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-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  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-grp 13585  df-minusg 13586  df-mgp 13933  df-ur 13972  df-ring 14010
This theorem is referenced by:  subrgid  14236
  Copyright terms: Public domain W3C validator