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

Theorem subrgex 14643
Description: The class of subrings of a ring is a set. (Contributed by Jim Kingdon, 12-Nov-2026.)
Assertion
Ref Expression
subrgex  |-  ( R  e.  Ring  ->  (SubRing `  R
)  e.  _V )

Proof of Theorem subrgex
Dummy variables  s  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-subrg 14640 . . 3  |- SubRing  =  ( w  e.  Ring  |->  { s  e.  ~P ( Base `  w )  |  ( ( w ↾s  s )  e. 
Ring  /\  ( 1r `  w )  e.  s ) } )
2 fveq2 5701 . . . . 5  |-  ( w  =  R  ->  ( Base `  w )  =  ( Base `  R
) )
32pweqd 3693 . . . 4  |-  ( w  =  R  ->  ~P ( Base `  w )  =  ~P ( Base `  R
) )
4 oveq1 6098 . . . . . 6  |-  ( w  =  R  ->  (
w ↾s  s )  =  ( R ↾s  s ) )
54eleq1d 2307 . . . . 5  |-  ( w  =  R  ->  (
( w ↾s  s )  e. 
Ring 
<->  ( R ↾s  s )  e. 
Ring ) )
6 fveq2 5701 . . . . . 6  |-  ( w  =  R  ->  ( 1r `  w )  =  ( 1r `  R
) )
76eleq1d 2307 . . . . 5  |-  ( w  =  R  ->  (
( 1r `  w
)  e.  s  <->  ( 1r `  R )  e.  s ) )
85, 7anbi12d 477 . . . 4  |-  ( w  =  R  ->  (
( ( w ↾s  s )  e.  Ring  /\  ( 1r `  w )  e.  s )  <->  ( ( R ↾s  s )  e.  Ring  /\  ( 1r `  R
)  e.  s ) ) )
93, 8rabeqbidv 2816 . . 3  |-  ( w  =  R  ->  { s  e.  ~P ( Base `  w )  |  ( ( w ↾s  s )  e. 
Ring  /\  ( 1r `  w )  e.  s ) }  =  {
s  e.  ~P ( Base `  R )  |  ( ( R ↾s  s )  e.  Ring  /\  ( 1r `  R )  e.  s ) } )
10 id 19 . . 3  |-  ( R  e.  Ring  ->  R  e. 
Ring )
11 eqid 2238 . . . 4  |-  { s  e.  ~P ( Base `  R )  |  ( ( R ↾s  s )  e. 
Ring  /\  ( 1r `  R )  e.  s ) }  =  {
s  e.  ~P ( Base `  R )  |  ( ( R ↾s  s )  e.  Ring  /\  ( 1r `  R )  e.  s ) }
12 basfn 13472 . . . . . 6  |-  Base  Fn  _V
13 elex 2833 . . . . . 6  |-  ( R  e.  Ring  ->  R  e. 
_V )
14 funfvex 5718 . . . . . . 7  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1514funfni 5489 . . . . . 6  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
1612, 13, 15sylancr 418 . . . . 5  |-  ( R  e.  Ring  ->  ( Base `  R )  e.  _V )
1716pwexd 4320 . . . 4  |-  ( R  e.  Ring  ->  ~P ( Base `  R )  e. 
_V )
1811, 17rabexd 4283 . . 3  |-  ( R  e.  Ring  ->  { s  e.  ~P ( Base `  R )  |  ( ( R ↾s  s )  e. 
Ring  /\  ( 1r `  R )  e.  s ) }  e.  _V )
191, 9, 10, 18fvmptd3 5805 . 2  |-  ( R  e.  Ring  ->  (SubRing `  R
)  =  { s  e.  ~P ( Base `  R )  |  ( ( R ↾s  s )  e. 
Ring  /\  ( 1r `  R )  e.  s ) } )
2019, 18eqeltrd 2315 1  |-  ( R  e.  Ring  ->  (SubRing `  R
)  e.  _V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   {crab 2532   _Vcvv 2821   ~Pcpw 3688    Fn wfn 5378   ` cfv 5383  (class class class)co 6091   Basecbs 13413   ↾s cress 13414   1rcur 14373   Ringcrg 14411  SubRingcsubrg 14638
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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8280  ax-resscn 8281  ax-1re 8283  ax-addrcl 8286
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5343  df-fun 5385  df-fn 5386  df-fv 5391  df-ov 6094  df-inn 9318  df-ndx 13416  df-slot 13417  df-base 13419  df-subrg 14640
This theorem is used by:  mpfrcl  15272  evlsval  15273
  Copyright terms: Public domain W3C validator