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

Theorem subrngintm 14520
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 14512 . . . . 5  |-  ( r  e.  (SubRng `  R
)  ->  r  e.  (SubGrp `  R ) )
21ssriv 3252 . . . 4  |-  (SubRng `  R )  C_  (SubGrp `  R )
3 sstr 3256 . . . 4  |-  ( ( S  C_  (SubRng `  R
)  /\  (SubRng `  R
)  C_  (SubGrp `  R
) )  ->  S  C_  (SubGrp `  R )
)
42, 3mpan2 429 . . 3  |-  ( S 
C_  (SubRng `  R )  ->  S  C_  (SubGrp `  R
) )
5 subgintm 14001 . . 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 3243 . . . . . . 7  |-  ( ( S  C_  (SubRng `  R
)  /\  r  e.  S )  ->  r  e.  (SubRng `  R )
)
87ad4ant14 518 . . . . . 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 535 . . . . . . 7  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  x  e.  |^| S )
10 elinti 3979 . . . . . . . 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 537 . . . . . . 7  |-  ( ( ( S  C_  (SubRng `  R )  /\  E. j  j  e.  S
)  /\  ( x  e.  |^| S  /\  y  e.  |^| S ) )  ->  y  e.  |^| S )
14 elinti 3979 . . . . . . . 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 2238 . . . . . . 7  |-  ( .r
`  R )  =  ( .r `  R
)
1817subrngmcl 14517 . . . . . 6  |-  ( ( r  e.  (SubRng `  R )  /\  x  e.  r  /\  y  e.  r )  ->  (
x ( .r `  R ) y )  e.  r )
198, 12, 16, 18syl3anc 1278 . . . . 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 2623 . . . 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 3242 . . . . . . . . 9  |-  ( S 
C_  (SubRng `  R )  ->  ( j  e.  S  ->  j  e.  (SubRng `  R ) ) )
22 subrngrcl 14511 . . . . . . . . 9  |-  ( j  e.  (SubRng `  R
)  ->  R  e. Rng )
2321, 22syl6 33 . . . . . . . 8  |-  ( S 
C_  (SubRng `  R )  ->  ( j  e.  S  ->  R  e. Rng ) )
2423exlimdv 1872 . . . . . . 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 2824 . . . . . . . 8  |-  x  e. 
_V
2726a1i 9 . . . . . . 7  |-  ( R  e. Rng  ->  x  e.  _V )
28 mulrslid 13486 . . . . . . . 8  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2928slotex 13379 . . . . . . 7  |-  ( R  e. Rng  ->  ( .r `  R )  e.  _V )
30 vex 2824 . . . . . . . 8  |-  y  e. 
_V
3130a1i 9 . . . . . . 7  |-  ( R  e. Rng  ->  y  e.  _V )
32 ovexg 6119 . . . . . . 7  |-  ( ( x  e.  _V  /\  ( .r `  R )  e.  _V  /\  y  e.  _V )  ->  (
x ( .r `  R ) y )  e.  _V )
3327, 29, 31, 32syl3anc 1278 . . . . . 6  |-  ( R  e. Rng  ->  ( x ( .r `  R ) y )  e.  _V )
34 elintg 3978 . . . . . 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 2632 . 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 2238 . . . 4  |-  ( Base `  R )  =  (
Base `  R )
4039, 17issubrng2 14518 . . 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 957 1  |-  ( ( S  C_  (SubRng `  R
)  /\  E. j 
j  e.  S )  ->  |^| S  e.  (SubRng `  R ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105   E.wex 1545    e. wcel 2209   A.wral 2528   _Vcvv 2821    C_ wss 3220   |^|cint 3970   ` cfv 5377  (class class class)co 6085   Basecbs 13352   .rcmulr 13432  SubGrpcsubg 13970  Rngcrng 14231  SubRngcsubrng 14505
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-subg 13973  df-cmn 14089  df-abl 14090  df-mgp 14218  df-rng 14232  df-subrng 14506
This theorem is used by:  subrngin  14521
  Copyright terms: Public domain W3C validator