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

Theorem issubrg 14316
Description: The subring predicate. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Proof shortened by AV, 12-Oct-2020.)
Hypotheses
Ref Expression
issubrg.b  |-  B  =  ( Base `  R
)
issubrg.i  |-  .1.  =  ( 1r `  R )
Assertion
Ref Expression
issubrg  |-  ( A  e.  (SubRing `  R
)  <->  ( ( R  e.  Ring  /\  ( Rs  A )  e.  Ring )  /\  ( A  C_  B  /\  .1.  e.  A
) ) )

Proof of Theorem issubrg
Dummy variables  s  r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-subrg 14314 . . 3  |- SubRing  =  ( r  e.  Ring  |->  { s  e.  ~P ( Base `  r )  |  ( ( rs  s )  e. 
Ring  /\  ( 1r `  r )  e.  s ) } )
21mptrcl 5738 . 2  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
3 simpll 527 . 2  |-  ( ( ( R  e.  Ring  /\  ( Rs  A )  e.  Ring )  /\  ( A  C_  B  /\  .1.  e.  A
) )  ->  R  e.  Ring )
4 fveq2 5648 . . . . . . . 8  |-  ( r  =  R  ->  ( Base `  r )  =  ( Base `  R
) )
5 issubrg.b . . . . . . . 8  |-  B  =  ( Base `  R
)
64, 5eqtr4di 2282 . . . . . . 7  |-  ( r  =  R  ->  ( Base `  r )  =  B )
76pweqd 3661 . . . . . 6  |-  ( r  =  R  ->  ~P ( Base `  r )  =  ~P B )
8 oveq1 6035 . . . . . . . 8  |-  ( r  =  R  ->  (
rs  s )  =  ( Rs  s ) )
98eleq1d 2300 . . . . . . 7  |-  ( r  =  R  ->  (
( rs  s )  e. 
Ring 
<->  ( Rs  s )  e. 
Ring ) )
10 fveq2 5648 . . . . . . . . 9  |-  ( r  =  R  ->  ( 1r `  r )  =  ( 1r `  R
) )
11 issubrg.i . . . . . . . . 9  |-  .1.  =  ( 1r `  R )
1210, 11eqtr4di 2282 . . . . . . . 8  |-  ( r  =  R  ->  ( 1r `  r )  =  .1.  )
1312eleq1d 2300 . . . . . . 7  |-  ( r  =  R  ->  (
( 1r `  r
)  e.  s  <->  .1.  e.  s ) )
149, 13anbi12d 473 . . . . . 6  |-  ( r  =  R  ->  (
( ( rs  s )  e.  Ring  /\  ( 1r `  r )  e.  s )  <->  ( ( Rs  s )  e.  Ring  /\  .1.  e.  s ) ) )
157, 14rabeqbidv 2798 . . . . 5  |-  ( r  =  R  ->  { s  e.  ~P ( Base `  r )  |  ( ( rs  s )  e. 
Ring  /\  ( 1r `  r )  e.  s ) }  =  {
s  e.  ~P B  |  ( ( Rs  s )  e.  Ring  /\  .1.  e.  s ) } )
16 id 19 . . . . 5  |-  ( R  e.  Ring  ->  R  e. 
Ring )
17 basfn 13221 . . . . . . . . 9  |-  Base  Fn  _V
18 elex 2815 . . . . . . . . 9  |-  ( R  e.  Ring  ->  R  e. 
_V )
19 funfvex 5665 . . . . . . . . . 10  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
2019funfni 5439 . . . . . . . . 9  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
2117, 18, 20sylancr 414 . . . . . . . 8  |-  ( R  e.  Ring  ->  ( Base `  R )  e.  _V )
225, 21eqeltrid 2318 . . . . . . 7  |-  ( R  e.  Ring  ->  B  e. 
_V )
2322pwexd 4277 . . . . . 6  |-  ( R  e.  Ring  ->  ~P B  e.  _V )
24 rabexg 4238 . . . . . 6  |-  ( ~P B  e.  _V  ->  { s  e.  ~P B  |  ( ( Rs  s )  e.  Ring  /\  .1.  e.  s ) }  e.  _V )
2523, 24syl 14 . . . . 5  |-  ( R  e.  Ring  ->  { s  e.  ~P B  | 
( ( Rs  s )  e.  Ring  /\  .1.  e.  s ) }  e.  _V )
261, 15, 16, 25fvmptd3 5749 . . . 4  |-  ( R  e.  Ring  ->  (SubRing `  R
)  =  { s  e.  ~P B  | 
( ( Rs  s )  e.  Ring  /\  .1.  e.  s ) } )
2726eleq2d 2301 . . 3  |-  ( R  e.  Ring  ->  ( A  e.  (SubRing `  R
)  <->  A  e.  { s  e.  ~P B  | 
( ( Rs  s )  e.  Ring  /\  .1.  e.  s ) } ) )
28 oveq2 6036 . . . . . . . 8  |-  ( s  =  A  ->  ( Rs  s )  =  ( Rs  A ) )
2928eleq1d 2300 . . . . . . 7  |-  ( s  =  A  ->  (
( Rs  s )  e. 
Ring 
<->  ( Rs  A )  e.  Ring ) )
30 eleq2 2295 . . . . . . 7  |-  ( s  =  A  ->  (  .1.  e.  s  <->  .1.  e.  A ) )
3129, 30anbi12d 473 . . . . . 6  |-  ( s  =  A  ->  (
( ( Rs  s )  e.  Ring  /\  .1.  e.  s )  <->  ( ( Rs  A )  e.  Ring  /\  .1.  e.  A ) ) )
3231elrab 2963 . . . . 5  |-  ( A  e.  { s  e. 
~P B  |  ( ( Rs  s )  e. 
Ring  /\  .1.  e.  s ) }  <->  ( A  e.  ~P B  /\  (
( Rs  A )  e.  Ring  /\  .1.  e.  A ) ) )
3332a1i 9 . . . 4  |-  ( R  e.  Ring  ->  ( A  e.  { s  e. 
~P B  |  ( ( Rs  s )  e. 
Ring  /\  .1.  e.  s ) }  <->  ( A  e.  ~P B  /\  (
( Rs  A )  e.  Ring  /\  .1.  e.  A ) ) ) )
34 elpw2g 4251 . . . . . 6  |-  ( B  e.  _V  ->  ( A  e.  ~P B  <->  A 
C_  B ) )
3522, 34syl 14 . . . . 5  |-  ( R  e.  Ring  ->  ( A  e.  ~P B  <->  A  C_  B
) )
3635anbi1d 465 . . . 4  |-  ( R  e.  Ring  ->  ( ( A  e.  ~P B  /\  ( ( Rs  A )  e.  Ring  /\  .1.  e.  A ) )  <->  ( A  C_  B  /\  ( ( Rs  A )  e.  Ring  /\  .1.  e.  A ) ) ) )
37 an12 563 . . . . 5  |-  ( ( A  C_  B  /\  ( ( Rs  A )  e.  Ring  /\  .1.  e.  A ) )  <->  ( ( Rs  A )  e.  Ring  /\  ( A  C_  B  /\  .1.  e.  A ) ) )
3837a1i 9 . . . 4  |-  ( R  e.  Ring  ->  ( ( A  C_  B  /\  ( ( Rs  A )  e.  Ring  /\  .1.  e.  A ) )  <->  ( ( Rs  A )  e.  Ring  /\  ( A  C_  B  /\  .1.  e.  A ) ) ) )
3933, 36, 383bitrd 214 . . 3  |-  ( R  e.  Ring  ->  ( A  e.  { s  e. 
~P B  |  ( ( Rs  s )  e. 
Ring  /\  .1.  e.  s ) }  <->  ( ( Rs  A )  e.  Ring  /\  ( A  C_  B  /\  .1.  e.  A ) ) ) )
40 ibar 301 . . . 4  |-  ( R  e.  Ring  ->  ( ( Rs  A )  e.  Ring  <->  ( R  e.  Ring  /\  ( Rs  A )  e.  Ring ) ) )
4140anbi1d 465 . . 3  |-  ( R  e.  Ring  ->  ( ( ( Rs  A )  e.  Ring  /\  ( A  C_  B  /\  .1.  e.  A ) )  <->  ( ( R  e.  Ring  /\  ( Rs  A )  e.  Ring )  /\  ( A  C_  B  /\  .1.  e.  A
) ) ) )
4227, 39, 413bitrd 214 . 2  |-  ( R  e.  Ring  ->  ( A  e.  (SubRing `  R
)  <->  ( ( R  e.  Ring  /\  ( Rs  A )  e.  Ring )  /\  ( A  C_  B  /\  .1.  e.  A
) ) ) )
432, 3, 42pm5.21nii 712 1  |-  ( A  e.  (SubRing `  R
)  <->  ( ( R  e.  Ring  /\  ( Rs  A )  e.  Ring )  /\  ( A  C_  B  /\  .1.  e.  A
) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   {crab 2515   _Vcvv 2803    C_ wss 3201   ~Pcpw 3656    Fn wfn 5328   ` cfv 5333  (class class class)co 6028   Basecbs 13162   ↾s cress 13163   1rcur 14053   Ringcrg 14090  SubRingcsubrg 14312
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-inn 9203  df-ndx 13165  df-slot 13166  df-base 13168  df-subrg 14314
This theorem is referenced by:  subrgss  14317  subrgid  14318  subrgring  14319  subrgrcl  14321  subrg1cl  14324  issubrg2  14336  subsubrg  14340  subrgpropd  14348
  Copyright terms: Public domain W3C validator