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

Theorem sraex 13942
Description: Existence of a subring algebra. (Contributed by Jim Kingdon, 16-Apr-2025.)
Hypotheses
Ref Expression
srapart.a  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
srapart.s  |-  ( ph  ->  S  C_  ( Base `  W ) )
srapart.ex  |-  ( ph  ->  W  e.  X )
Assertion
Ref Expression
sraex  |-  ( ph  ->  A  e.  _V )

Proof of Theorem sraex
StepHypRef Expression
1 srapart.a . 2  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
2 srapart.ex . . . 4  |-  ( ph  ->  W  e.  X )
3 srapart.s . . . 4  |-  ( ph  ->  S  C_  ( Base `  W ) )
4 sraval 13933 . . . 4  |-  ( ( W  e.  X  /\  S  C_  ( Base `  W
) )  ->  (
(subringAlg  `  W ) `  S )  =  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
52, 3, 4syl2anc 411 . . 3  |-  ( ph  ->  ( (subringAlg  `  W ) `
 S )  =  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
6 scaslid 12770 . . . . . . . 8  |-  (Scalar  = Slot  (Scalar `  ndx )  /\  (Scalar `  ndx )  e.  NN )
76simpri 113 . . . . . . 7  |-  (Scalar `  ndx )  e.  NN
87a1i 9 . . . . . 6  |-  ( ph  ->  (Scalar `  ndx )  e.  NN )
9 basfn 12676 . . . . . . . . 9  |-  Base  Fn  _V
102elexd 2773 . . . . . . . . 9  |-  ( ph  ->  W  e.  _V )
11 funfvex 5571 . . . . . . . . . 10  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
1211funfni 5354 . . . . . . . . 9  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
139, 10, 12sylancr 414 . . . . . . . 8  |-  ( ph  ->  ( Base `  W
)  e.  _V )
1413, 3ssexd 4169 . . . . . . 7  |-  ( ph  ->  S  e.  _V )
15 ressex 12683 . . . . . . 7  |-  ( ( W  e.  X  /\  S  e.  _V )  ->  ( Ws  S )  e.  _V )
162, 14, 15syl2anc 411 . . . . . 6  |-  ( ph  ->  ( Ws  S )  e.  _V )
17 setsex 12650 . . . . . 6  |-  ( ( W  e.  X  /\  (Scalar `  ndx )  e.  NN  /\  ( Ws  S )  e.  _V )  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
182, 8, 16, 17syl3anc 1249 . . . . 5  |-  ( ph  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
19 vscaslid 12780 . . . . . . 7  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
2019simpri 113 . . . . . 6  |-  ( .s
`  ndx )  e.  NN
2120a1i 9 . . . . 5  |-  ( ph  ->  ( .s `  ndx )  e.  NN )
22 mulrslid 12749 . . . . . . 7  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2322slotex 12645 . . . . . 6  |-  ( W  e.  X  ->  ( .r `  W )  e. 
_V )
242, 23syl 14 . . . . 5  |-  ( ph  ->  ( .r `  W
)  e.  _V )
25 setsex 12650 . . . . 5  |-  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V  /\  ( .s
`  ndx )  e.  NN  /\  ( .r `  W
)  e.  _V )  ->  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
2618, 21, 24, 25syl3anc 1249 . . . 4  |-  ( ph  ->  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
27 ipslid 12788 . . . . . 6  |-  ( .i  = Slot  ( .i `  ndx )  /\  ( .i `  ndx )  e.  NN )
2827simpri 113 . . . . 5  |-  ( .i
`  ndx )  e.  NN
2928a1i 9 . . . 4  |-  ( ph  ->  ( .i `  ndx )  e.  NN )
30 setsex 12650 . . . 4  |-  ( ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V  /\  ( .i
`  ndx )  e.  NN  /\  ( .r `  W
)  e.  _V )  ->  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
3126, 29, 24, 30syl3anc 1249 . . 3  |-  ( ph  ->  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
325, 31eqeltrd 2270 . 2  |-  ( ph  ->  ( (subringAlg  `  W ) `
 S )  e. 
_V )
331, 32eqeltrd 2270 1  |-  ( ph  ->  A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2164   _Vcvv 2760    C_ wss 3153   <.cop 3621    Fn wfn 5249   ` cfv 5254  (class class class)co 5918   NNcn 8982   ndxcnx 12615   sSet csts 12616  Slot cslot 12617   Basecbs 12618   ↾s cress 12619   .rcmulr 12696  Scalarcsca 12698   .scvsca 12699   .icip 12700  subringAlg csra 13929
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-inn 8983  df-2 9041  df-3 9042  df-4 9043  df-5 9044  df-6 9045  df-7 9046  df-8 9047  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626  df-mulr 12709  df-sca 12711  df-vsca 12712  df-ip 12713  df-sra 13931
This theorem is referenced by:  sratopng  13943  sralmod0g  13947  rlmfn  13949  rlmvalg  13950
  Copyright terms: Public domain W3C validator