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

Theorem subrngintm 14225
Description: The intersection of a nonempty collection of subrings is a subring. (Contributed by AV, 15-Feb-2025.)
Assertion
Ref Expression
subrngintm  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  |^| S  e.  (SubRng `  R ) )
Distinct variable groups:    R, j    S, j

Proof of Theorem subrngintm
Dummy variables  r  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 subrngsubg 14217 . . . . 5  |-  ( r  e.  (SubRng `  R
)  ->  r  e.  (SubGrp `  R ) )
21ssriv 3231 . . . 4  |-  (SubRng `  R )  C_  (SubGrp `  R )
3 sstr 3235 . . . 4  |-  ( ( S  C_  (SubRng `  R
)  /\  (SubRng `  R
)  C_  (SubGrp `  R
) )  ->  S  C_  (SubGrp `  R )
)
42, 3mpan2 425 . . 3  |-  ( S 
C_  (SubRng `  R )  ->  S  C_  (SubGrp `  R
) )
5 subgintm 13784 . . 3  |-  ( ( S  C_  (SubGrp `  R
)  /\  E. j 
j  e.  S )  ->  |^| S  e.  (SubGrp `  R ) )
64, 5sylan 283 . 2  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  |^| S  e.  (SubGrp `  R ) )
7 ssel2 3222 . . . . . . 7  |-  ( ( S  C_  (SubRng `  R
)  /\  r  e.  S )  ->  r  e.  (SubRng `  R )
)
87ad4ant14 514 . . . . . 6  |-  ( ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  /\  r  e.  S
)  ->  r  e.  (SubRng `  R ) )
9 simprl 531 . . . . . . 7  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  x  e.  |^| S )
10 elinti 3937 . . . . . . . 8  |-  ( x  e.  |^| S  ->  (
r  e.  S  ->  x  e.  r )
)
1110imp 124 . . . . . . 7  |-  ( ( x  e.  |^| S  /\  r  e.  S
)  ->  x  e.  r )
129, 11sylan 283 . . . . . 6  |-  ( ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  /\  r  e.  S
)  ->  x  e.  r )
13 simprr 533 . . . . . . 7  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  y  e.  |^| S )
14 elinti 3937 . . . . . . . 8  |-  ( y  e.  |^| S  ->  (
r  e.  S  -> 
y  e.  r ) )
1514imp 124 . . . . . . 7  |-  ( ( y  e.  |^| S  /\  r  e.  S
)  ->  y  e.  r )
1613, 15sylan 283 . . . . . 6  |-  ( ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  /\  r  e.  S
)  ->  y  e.  r )
17 eqid 2231 . . . . . . 7  |-  ( .r
`  R )  =  ( .r `  R
)
1817subrngmcl 14222 . . . . . 6  |-  ( ( r  e.  (SubRng `  R )  /\  x  e.  r  /\  y  e.  r )  ->  (
x ( .r `  R ) y )  e.  r )
198, 12, 16, 18syl3anc 1273 . . . . 5  |-  ( ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  /\  r  e.  S
)  ->  ( x
( .r `  R
) y )  e.  r )
2019ralrimiva 2605 . . . 4  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  A. r  e.  S  ( x ( .r
`  R ) y )  e.  r )
21 ssel 3221 . . . . . . . . 9  |-  ( S 
C_  (SubRng `  R )  ->  ( j  e.  S  ->  j  e.  (SubRng `  R ) ) )
22 subrngrcl 14216 . . . . . . . . 9  |-  ( j  e.  (SubRng `  R
)  ->  R  e. Rng )
2321, 22syl6 33 . . . . . . . 8  |-  ( S 
C_  (SubRng `  R )  ->  ( j  e.  S  ->  R  e. Rng ) )
2423exlimdv 1867 . . . . . . 7  |-  ( S 
C_  (SubRng `  R )  ->  ( E. j  j  e.  S  ->  R  e. Rng ) )
2524imp 124 . . . . . 6  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  R  e. Rng )
26 vex 2805 . . . . . . . 8  |-  x  e. 
_V
2726a1i 9 . . . . . . 7  |-  ( R  e. Rng  ->  x  e.  _V )
28 mulrslid 13214 . . . . . . . 8  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2928slotex 13108 . . . . . . 7  |-  ( R  e. Rng  ->  ( .r `  R )  e.  _V )
30 vex 2805 . . . . . . . 8  |-  y  e. 
_V
3130a1i 9 . . . . . . 7  |-  ( R  e. Rng  ->  y  e.  _V )
32 ovexg 6051 . . . . . . 7  |-  ( ( x  e.  _V  /\  ( .r `  R )  e.  _V  /\  y  e.  _V )  ->  (
x ( .r `  R ) y )  e.  _V )
3327, 29, 31, 32syl3anc 1273 . . . . . 6  |-  ( R  e. Rng  ->  ( x ( .r `  R ) y )  e.  _V )
34 elintg 3936 . . . . . 6  |-  ( ( x ( .r `  R ) y )  e.  _V  ->  (
( x ( .r
`  R ) y )  e.  |^| S  <->  A. r  e.  S  ( x ( .r `  R ) y )  e.  r ) )
3525, 33, 343syl 17 . . . . 5  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  ( ( x ( .r `  R
) y )  e. 
|^| S  <->  A. r  e.  S  ( x
( .r `  R
) y )  e.  r ) )
3635adantr 276 . . . 4  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  ( ( x ( .r `  R
) y )  e. 
|^| S  <->  A. r  e.  S  ( x
( .r `  R
) y )  e.  r ) )
3720, 36mpbird 167 . . 3  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  ( x ( .r `  R ) y )  e.  |^| S )
3837ralrimivva 2614 . 2  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  A. x  e.  |^| S A. y  e.  |^| S ( x ( .r `  R ) y )  e.  |^| S )
39 eqid 2231 . . . 4  |-  ( Base `  R )  =  (
Base `  R )
4039, 17issubrng2 14223 . . 3  |-  ( R  e. Rng  ->  ( |^| S  e.  (SubRng `  R )  <->  (
|^| S  e.  (SubGrp `  R )  /\  A. x  e.  |^| S A. y  e.  |^| S ( x ( .r `  R ) y )  e.  |^| S ) ) )
4125, 40syl 14 . 2  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  ( |^| S  e.  (SubRng `  R )  <->  (
|^| S  e.  (SubGrp `  R )  /\  A. x  e.  |^| S A. y  e.  |^| S ( x ( .r `  R ) y )  e.  |^| S ) ) )
426, 38, 41mpbir2and 952 1  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  |^| S  e.  (SubRng `  R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   E.wex 1540    e. wcel 2202   A.wral 2510   _Vcvv 2802    C_ wss 3200   |^|cint 3928   ` cfv 5326  (class class class)co 6017   Basecbs 13081   .rcmulr 13160  SubGrpcsubg 13753  Rngcrng 13944  SubRngcsubrng 14210
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-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-iress 13089  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586  df-subg 13756  df-cmn 13872  df-abl 13873  df-mgp 13933  df-rng 13945  df-subrng 14211
This theorem is referenced by:  subrngin  14226
  Copyright terms: Public domain W3C validator