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

Theorem sraex 14542
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 14533 . . . 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 13316 . . . . . . . 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 13221 . . . . . . . . 9  |-  Base  Fn  _V
102elexd 2817 . . . . . . . . 9  |-  ( ph  ->  W  e.  _V )
11 funfvex 5665 . . . . . . . . . 10  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
1211funfni 5439 . . . . . . . . 9  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
139, 10, 12sylancr 414 . . . . . . . 8  |-  ( ph  ->  ( Base `  W
)  e.  _V )
1413, 3ssexd 4234 . . . . . . 7  |-  ( ph  ->  S  e.  _V )
15 ressex 13228 . . . . . . 7  |-  ( ( W  e.  X  /\  S  e.  _V )  ->  ( Ws  S )  e.  _V )
162, 14, 15syl2anc 411 . . . . . 6  |-  ( ph  ->  ( Ws  S )  e.  _V )
17 setsex 13194 . . . . . 6  |-  ( ( W  e.  X  /\  (Scalar `  ndx )  e.  NN  /\  ( Ws  S )  e.  _V )  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
182, 8, 16, 17syl3anc 1274 . . . . 5  |-  ( ph  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
19 vscaslid 13326 . . . . . . 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 13295 . . . . . . 7  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2322slotex 13189 . . . . . 6  |-  ( W  e.  X  ->  ( .r `  W )  e. 
_V )
242, 23syl 14 . . . . 5  |-  ( ph  ->  ( .r `  W
)  e.  _V )
25 setsex 13194 . . . . 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 1274 . . . 4  |-  ( ph  ->  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
27 ipslid 13334 . . . . . 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 13194 . . . 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 1274 . . 3  |-  ( ph  ->  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
325, 31eqeltrd 2308 . 2  |-  ( ph  ->  ( (subringAlg  `  W ) `
 S )  e. 
_V )
331, 32eqeltrd 2308 1  |-  ( ph  ->  A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202   _Vcvv 2803    C_ wss 3201   <.cop 3676    Fn wfn 5328   ` cfv 5333  (class class class)co 6028   NNcn 9202   ndxcnx 13159   sSet csts 13160  Slot cslot 13161   Basecbs 13162   ↾s cress 13163   .rcmulr 13241  Scalarcsca 13243   .scvsca 13244   .icip 13245  subringAlg csra 14529
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 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-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  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-fal 1404  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-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  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-iun 3977  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-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-5 9264  df-6 9265  df-7 9266  df-8 9267  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-iress 13170  df-mulr 13254  df-sca 13256  df-vsca 13257  df-ip 13258  df-sra 14531
This theorem is referenced by:  sratopng  14543  sralmod0g  14547  rlmfn  14549  rlmvalg  14550
  Copyright terms: Public domain W3C validator