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

Theorem rrgval 14399
Description: Value of the set or left-regular elements in a ring. (Contributed by Stefan O'Rear, 22-Mar-2015.)
Hypotheses
Ref Expression
rrgval.e  |-  E  =  (RLReg `  R )
rrgval.b  |-  B  =  ( Base `  R
)
rrgval.t  |-  .x.  =  ( .r `  R )
rrgval.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
rrgval  |-  E  =  { x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) }
Distinct variable groups:    x, B, y   
x, R, y
Allowed substitution hints:    .x. ( x, y)    E( x, y)    .0. ( x, y)

Proof of Theorem rrgval
Dummy variables  r  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rrgval.e . . . 4  |-  E  =  (RLReg `  R )
21rrgmex 14398 . . 3  |-  ( z  e.  E  ->  R  e.  _V )
3 elrabi 2969 . . . 4  |-  ( z  e.  { x  e.  B  |  A. y  e.  B  ( (
x  .x.  y )  =  .0.  ->  y  =  .0.  ) }  ->  z  e.  B )
4 rrgval.b . . . . 5  |-  B  =  ( Base `  R
)
54basmex 13264 . . . 4  |-  ( z  e.  B  ->  R  e.  _V )
63, 5syl 14 . . 3  |-  ( z  e.  { x  e.  B  |  A. y  e.  B  ( (
x  .x.  y )  =  .0.  ->  y  =  .0.  ) }  ->  R  e.  _V )
7 df-rlreg 14395 . . . . . 6  |- RLReg  =  ( r  e.  _V  |->  { x  e.  ( Base `  r )  |  A. y  e.  ( Base `  r ) ( ( x ( .r `  r ) y )  =  ( 0g `  r )  ->  y  =  ( 0g `  r ) ) } )
8 fveq2 5669 . . . . . . . 8  |-  ( r  =  R  ->  ( Base `  r )  =  ( Base `  R
) )
98, 4eqtr4di 2283 . . . . . . 7  |-  ( r  =  R  ->  ( Base `  r )  =  B )
10 fveq2 5669 . . . . . . . . . . . 12  |-  ( r  =  R  ->  ( .r `  r )  =  ( .r `  R
) )
11 rrgval.t . . . . . . . . . . . 12  |-  .x.  =  ( .r `  R )
1210, 11eqtr4di 2283 . . . . . . . . . . 11  |-  ( r  =  R  ->  ( .r `  r )  = 
.x.  )
1312oveqd 6066 . . . . . . . . . 10  |-  ( r  =  R  ->  (
x ( .r `  r ) y )  =  ( x  .x.  y ) )
14 fveq2 5669 . . . . . . . . . . 11  |-  ( r  =  R  ->  ( 0g `  r )  =  ( 0g `  R
) )
15 rrgval.z . . . . . . . . . . 11  |-  .0.  =  ( 0g `  R )
1614, 15eqtr4di 2283 . . . . . . . . . 10  |-  ( r  =  R  ->  ( 0g `  r )  =  .0.  )
1713, 16eqeq12d 2247 . . . . . . . . 9  |-  ( r  =  R  ->  (
( x ( .r
`  r ) y )  =  ( 0g
`  r )  <->  ( x  .x.  y )  =  .0.  ) )
1816eqeq2d 2244 . . . . . . . . 9  |-  ( r  =  R  ->  (
y  =  ( 0g
`  r )  <->  y  =  .0.  ) )
1917, 18imbi12d 234 . . . . . . . 8  |-  ( r  =  R  ->  (
( ( x ( .r `  r ) y )  =  ( 0g `  r )  ->  y  =  ( 0g `  r ) )  <->  ( ( x 
.x.  y )  =  .0.  ->  y  =  .0.  ) ) )
209, 19raleqbidv 2756 . . . . . . 7  |-  ( r  =  R  ->  ( A. y  e.  ( Base `  r ) ( ( x ( .r
`  r ) y )  =  ( 0g
`  r )  -> 
y  =  ( 0g
`  r ) )  <->  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) ) )
219, 20rabeqbidv 2807 . . . . . 6  |-  ( r  =  R  ->  { x  e.  ( Base `  r
)  |  A. y  e.  ( Base `  r
) ( ( x ( .r `  r
) y )  =  ( 0g `  r
)  ->  y  =  ( 0g `  r ) ) }  =  {
x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) } )
22 id 19 . . . . . 6  |-  ( R  e.  _V  ->  R  e.  _V )
23 basfn 13263 . . . . . . . . 9  |-  Base  Fn  _V
24 funfvex 5686 . . . . . . . . . 10  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
2524funfni 5457 . . . . . . . . 9  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
2623, 25mpan 424 . . . . . . . 8  |-  ( R  e.  _V  ->  ( Base `  R )  e. 
_V )
274, 26eqeltrid 2319 . . . . . . 7  |-  ( R  e.  _V  ->  B  e.  _V )
28 rabexg 4254 . . . . . . 7  |-  ( B  e.  _V  ->  { x  e.  B  |  A. y  e.  B  (
( x  .x.  y
)  =  .0.  ->  y  =  .0.  ) }  e.  _V )
2927, 28syl 14 . . . . . 6  |-  ( R  e.  _V  ->  { x  e.  B  |  A. y  e.  B  (
( x  .x.  y
)  =  .0.  ->  y  =  .0.  ) }  e.  _V )
307, 21, 22, 29fvmptd3 5770 . . . . 5  |-  ( R  e.  _V  ->  (RLReg `  R )  =  {
x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) } )
311, 30eqtrid 2277 . . . 4  |-  ( R  e.  _V  ->  E  =  { x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) } )
3231eleq2d 2302 . . 3  |-  ( R  e.  _V  ->  (
z  e.  E  <->  z  e.  { x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) } ) )
332, 6, 32pm5.21nii 712 . 2  |-  ( z  e.  E  <->  z  e.  { x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) } )
3433eqriv 2229 1  |-  E  =  { x  e.  B  |  A. y  e.  B  ( ( x  .x.  y )  =  .0. 
->  y  =  .0.  ) }
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2203   A.wral 2520   {crab 2524   _Vcvv 2812    Fn wfn 5346   ` cfv 5351  (class class class)co 6049   Basecbs 13204   .rcmulr 13283   0gc0g 13461  RLRegcrlreg 14392
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-cnex 8217  ax-resscn 8218  ax-1re 8220  ax-addrcl 8223
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fn 5354  df-fv 5359  df-ov 6052  df-inn 9237  df-ndx 13207  df-slot 13208  df-base 13210  df-rlreg 14395
This theorem is referenced by:  isrrg  14400  rrgeq0  14402  rrgss  14404
  Copyright terms: Public domain W3C validator