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

Theorem sraex 13978
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 13969 . . . 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 12806 . . . . . . . 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 12712 . . . . . . . . 9  |-  Base  Fn  _V
102elexd 2776 . . . . . . . . 9  |-  ( ph  ->  W  e.  _V )
11 funfvex 5575 . . . . . . . . . 10  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
1211funfni 5358 . . . . . . . . 9  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
139, 10, 12sylancr 414 . . . . . . . 8  |-  ( ph  ->  ( Base `  W
)  e.  _V )
1413, 3ssexd 4173 . . . . . . 7  |-  ( ph  ->  S  e.  _V )
15 ressex 12719 . . . . . . 7  |-  ( ( W  e.  X  /\  S  e.  _V )  ->  ( Ws  S )  e.  _V )
162, 14, 15syl2anc 411 . . . . . 6  |-  ( ph  ->  ( Ws  S )  e.  _V )
17 setsex 12686 . . . . . 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 12816 . . . . . . 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 12785 . . . . . . 7  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2322slotex 12681 . . . . . 6  |-  ( W  e.  X  ->  ( .r `  W )  e. 
_V )
242, 23syl 14 . . . . 5  |-  ( ph  ->  ( .r `  W
)  e.  _V )
25 setsex 12686 . . . . 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 12824 . . . . . 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 12686 . . . 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 2273 . 2  |-  ( ph  ->  ( (subringAlg  `  W ) `
 S )  e. 
_V )
331, 32eqeltrd 2273 1  |-  ( ph  ->  A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2167   _Vcvv 2763    C_ wss 3157   <.cop 3625    Fn wfn 5253   ` cfv 5258  (class class class)co 5922   NNcn 8987   ndxcnx 12651   sSet csts 12652  Slot cslot 12653   Basecbs 12654   ↾s cress 12655   .rcmulr 12732  Scalarcsca 12734   .scvsca 12735   .icip 12736  subringAlg csra 13965
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7968  ax-resscn 7969  ax-1re 7971  ax-addrcl 7974
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-inn 8988  df-2 9046  df-3 9047  df-4 9048  df-5 9049  df-6 9050  df-7 9051  df-8 9052  df-ndx 12657  df-slot 12658  df-base 12660  df-sets 12661  df-iress 12662  df-mulr 12745  df-sca 12747  df-vsca 12748  df-ip 12749  df-sra 13967
This theorem is referenced by:  sratopng  13979  sralmod0g  13983  rlmfn  13985  rlmvalg  13986
  Copyright terms: Public domain W3C validator