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

Theorem ringressid 14452
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 13478. (Contributed by Jim Kingdon, 28-Feb-2025.)
Hypothesis
Ref Expression
ringressid.b  |-  B  =  ( Base `  G
)
Assertion
Ref Expression
ringressid  |-  ( G  e.  Ring  ->  ( G ↾s  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 2239 . . 3  |-  ( G  e.  Ring  ->  ( G ↾s  B )  =  ( G ↾s  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 3269 . . 3  |-  ( G  e.  Ring  ->  B  C_  B )
61, 3, 4, 5ressbas2d 13475 . 2  |-  ( G  e.  Ring  ->  B  =  ( Base `  ( G ↾s  B ) ) )
7 eqidd 2239 . . 3  |-  ( G  e.  Ring  ->  ( +g  `  G )  =  ( +g  `  G ) )
8 basfn 13463 . . . . 5  |-  Base  Fn  _V
9 elex 2833 . . . . 5  |-  ( G  e.  Ring  ->  G  e. 
_V )
10 funfvex 5712 . . . . . 6  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
1110funfni 5483 . . . . 5  |-  ( (
Base  Fn  _V  /\  G  e.  _V )  ->  ( Base `  G )  e. 
_V )
128, 9, 11sylancr 418 . . . 4  |-  ( G  e.  Ring  ->  ( Base `  G )  e.  _V )
132, 12eqeltrid 2325 . . 3  |-  ( G  e.  Ring  ->  B  e. 
_V )
141, 7, 13, 4ressplusgd 13536 . 2  |-  ( G  e.  Ring  ->  ( +g  `  G )  =  ( +g  `  ( G ↾s  B ) ) )
15 eqid 2238 . . . 4  |-  ( G ↾s  B )  =  ( G ↾s  B )
16 eqid 2238 . . . 4  |-  ( .r
`  G )  =  ( .r `  G
)
1715, 16ressmulrg 13552 . . 3  |-  ( ( B  e.  _V  /\  G  e.  Ring )  -> 
( .r `  G
)  =  ( .r
`  ( G ↾s  B ) ) )
1813, 17mpancom 426 . 2  |-  ( G  e.  Ring  ->  ( .r
`  G )  =  ( .r `  ( G ↾s  B ) ) )
19 ringgrp 14389 . . 3  |-  ( G  e.  Ring  ->  G  e. 
Grp )
202grpressid 13919 . . 3  |-  ( G  e.  Grp  ->  ( G ↾s  B )  e.  Grp )
2119, 20syl 14 . 2  |-  ( G  e.  Ring  ->  ( G ↾s  B )  e.  Grp )
222, 16ringcl 14401 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B  /\  y  e.  B )  ->  (
x ( .r `  G ) y )  e.  B )
232, 16ringass 14404 . 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 2238 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
252, 24, 16ringdi 14407 . 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 14408 . 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 2238 . . 3  |-  ( 1r
`  G )  =  ( 1r `  G
)
282, 27ringidcl 14409 . 2  |-  ( G  e.  Ring  ->  ( 1r
`  G )  e.  B )
292, 16, 27ringlidm 14412 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B )  ->  (
( 1r `  G
) ( .r `  G ) x )  =  x )
302, 16, 27ringridm 14413 . 2  |-  ( ( G  e.  Ring  /\  x  e.  B )  ->  (
x ( .r `  G ) ( 1r
`  G ) )  =  x )
316, 14, 18, 21, 22, 23, 25, 26, 28, 29, 30isringd 14430 1  |-  ( G  e.  Ring  ->  ( G ↾s  B )  e.  Ring )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    Fn wfn 5372   ` cfv 5377  (class class class)co 6085   Basecbs 13404   ↾s cress 13405   +g cplusg 13484   .rcmulr 13485   Grpcgrp 13858   1rcur 14346   Ringcrg 14384
This proof depends on 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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-mulr 13498  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-mgp 14302  df-ur 14347  df-ring 14386
This theorem is used by:  subrgid  14615
  Copyright terms: Public domain W3C validator