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

Theorem ringressid 14066
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 13144. (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 2230 . . 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 3246 . . 3  |-  ( G  e.  Ring  ->  B  C_  B )
61, 3, 4, 5ressbas2d 13141 . 2  |-  ( G  e.  Ring  ->  B  =  ( Base `  ( Gs  B ) ) )
7 eqidd 2230 . . 3  |-  ( G  e.  Ring  ->  ( +g  `  G )  =  ( +g  `  G ) )
8 basfn 13131 . . . . 5  |-  Base  Fn  _V
9 elex 2812 . . . . 5  |-  ( G  e.  Ring  ->  G  e. 
_V )
10 funfvex 5652 . . . . . 6  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
1110funfni 5429 . . . . 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 2316 . . 3  |-  ( G  e.  Ring  ->  B  e. 
_V )
141, 7, 13, 4ressplusgd 13202 . 2  |-  ( G  e.  Ring  ->  ( +g  `  G )  =  ( +g  `  ( Gs  B ) ) )
15 eqid 2229 . . . 4  |-  ( Gs  B )  =  ( Gs  B )
16 eqid 2229 . . . 4  |-  ( .r
`  G )  =  ( .r `  G
)
1715, 16ressmulrg 13218 . . 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 14004 . . 3  |-  ( G  e.  Ring  ->  G  e. 
Grp )
202grpressid 13634 . . 3  |-  ( G  e.  Grp  ->  ( Gs  B )  e.  Grp )
2119, 20syl 14 . 2  |-  ( G  e.  Ring  ->  ( Gs  B )  e.  Grp )
222, 16ringcl 14016 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B  /\  y  e.  B )  ->  (
x ( .r `  G ) y )  e.  B )
232, 16ringass 14019 . 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 2229 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
252, 24, 16ringdi 14021 . 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 14022 . 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 2229 . . 3  |-  ( 1r
`  G )  =  ( 1r `  G
)
282, 27ringidcl 14023 . 2  |-  ( G  e.  Ring  ->  ( 1r
`  G )  e.  B )
292, 16, 27ringlidm 14026 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B )  ->  (
( 1r `  G
) ( .r `  G ) x )  =  x )
302, 16, 27ringridm 14027 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B )  ->  (
x ( .r `  G ) ( 1r
`  G ) )  =  x )
316, 14, 18, 21, 22, 23, 25, 26, 28, 29, 30isringd 14044 1  |-  ( G  e.  Ring  ->  ( Gs  B )  e.  Ring )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200   _Vcvv 2800    Fn wfn 5319   ` cfv 5324  (class class class)co 6013   Basecbs 13072   ↾s cress 13073   +g cplusg 13150   .rcmulr 13151   Grpcgrp 13573   1rcur 13962   Ringcrg 13999
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-inn 9134  df-2 9192  df-3 9193  df-ndx 13075  df-slot 13076  df-base 13078  df-sets 13079  df-iress 13080  df-plusg 13163  df-mulr 13164  df-0g 13331  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-grp 13576  df-minusg 13577  df-mgp 13924  df-ur 13963  df-ring 14001
This theorem is referenced by:  subrgid  14227
  Copyright terms: Public domain W3C validator