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

Theorem rrgmex 14571
Description: A structure whose set of left-regular elements is inhabited is a set. (Contributed by Jim Kingdon, 12-Aug-2025.)
Hypothesis
Ref Expression
rrgmex.e  |-  E  =  (RLReg `  R )
Assertion
Ref Expression
rrgmex  |-  ( A  e.  E  ->  R  e.  _V )

Proof of Theorem rrgmex
Dummy variables  x  r  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mptrel 4908 . . . 4  |-  Rel  (
r  e.  _V  |->  { x  e.  ( Base `  r )  |  A. y  e.  ( Base `  r ) ( ( x ( .r `  r ) y )  =  ( 0g `  r )  ->  y  =  ( 0g `  r ) ) } )
2 df-rlreg 14568 . . . . 5  |- RLReg  =  ( r  e.  _V  |->  { x  e.  ( Base `  r )  |  A. y  e.  ( Base `  r ) ( ( x ( .r `  r ) y )  =  ( 0g `  r )  ->  y  =  ( 0g `  r ) ) } )
32releqi 4858 . . . 4  |-  ( Rel RLReg  <->  Rel  ( r  e.  _V  |->  { x  e.  ( Base `  r )  | 
A. y  e.  (
Base `  r )
( ( x ( .r `  r ) y )  =  ( 0g `  r )  ->  y  =  ( 0g `  r ) ) } ) )
41, 3mpbir 146 . . 3  |-  Rel RLReg
5 rrgmex.e . . . . 5  |-  E  =  (RLReg `  R )
65eleq2i 2305 . . . 4  |-  ( A  e.  E  <->  A  e.  (RLReg `  R ) )
76biimpi 120 . . 3  |-  ( A  e.  E  ->  A  e.  (RLReg `  R )
)
8 relelfvdm 5727 . . 3  |-  ( ( Rel RLReg  /\  A  e.  (RLReg `  R ) )  ->  R  e.  dom RLReg )
94, 7, 8sylancr 418 . 2  |-  ( A  e.  E  ->  R  e.  dom RLReg )
109elexd 2835 1  |-  ( A  e.  E  ->  R  e.  _V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532   _Vcvv 2821    |-> cmpt 4192   dom cdm 4774   Rel wrel 4779   ` cfv 5377  (class class class)co 6085   Basecbs 13354   .rcmulr 13434   0gc0g 13612  RLRegcrlreg 14565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-xp 4780  df-rel 4781  df-dm 4784  df-iota 5337  df-fv 5385  df-rlreg 14568
This theorem is used by:  rrgval  14572
  Copyright terms: Public domain W3C validator