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

Theorem prdsplusgfval 14133
Description: Value of a structure product sum at a single coordinate. (Contributed by Stefan O'Rear, 10-Jan-2015.)
Hypotheses
Ref Expression
prdsbasmpt.y  |-  Y  =  ( S X_s R )
prdsbasmpt.b  |-  B  =  ( Base `  Y
)
prdsbasmpt.s  |-  ( ph  ->  S  e.  V )
prdsbasmpt.i  |-  ( ph  ->  I  e.  W )
prdsbasmpt.r  |-  ( ph  ->  R  Fn  I )
prdsplusgval.f  |-  ( ph  ->  F  e.  B )
prdsplusgval.g  |-  ( ph  ->  G  e.  B )
prdsplusgval.p  |-  .+  =  ( +g  `  Y )
prdsplusgfval.j  |-  ( ph  ->  J  e.  I )
Assertion
Ref Expression
prdsplusgfval  |-  ( ph  ->  ( ( F  .+  G ) `  J
)  =  ( ( F `  J ) ( +g  `  ( R `  J )
) ( G `  J ) ) )

Proof of Theorem prdsplusgfval
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 prdsbasmpt.y . . . 4  |-  Y  =  ( S X_s R )
2 prdsbasmpt.b . . . 4  |-  B  =  ( Base `  Y
)
3 prdsbasmpt.s . . . 4  |-  ( ph  ->  S  e.  V )
4 prdsbasmpt.i . . . 4  |-  ( ph  ->  I  e.  W )
5 prdsbasmpt.r . . . 4  |-  ( ph  ->  R  Fn  I )
6 prdsplusgval.f . . . 4  |-  ( ph  ->  F  e.  B )
7 prdsplusgval.g . . . 4  |-  ( ph  ->  G  e.  B )
8 prdsplusgval.p . . . 4  |-  .+  =  ( +g  `  Y )
91, 2, 3, 4, 5, 6, 7, 8prdsplusgval 14132 . . 3  |-  ( ph  ->  ( F  .+  G
)  =  ( x  e.  I  |->  ( ( F `  x ) ( +g  `  ( R `  x )
) ( G `  x ) ) ) )
109fveq1d 5679 . 2  |-  ( ph  ->  ( ( F  .+  G ) `  J
)  =  ( ( x  e.  I  |->  ( ( F `  x
) ( +g  `  ( R `  x )
) ( G `  x ) ) ) `
 J ) )
11 eqid 2234 . . 3  |-  ( x  e.  I  |->  ( ( F `  x ) ( +g  `  ( R `  x )
) ( G `  x ) ) )  =  ( x  e.  I  |->  ( ( F `
 x ) ( +g  `  ( R `
 x ) ) ( G `  x
) ) )
12 2fveq3 5682 . . . 4  |-  ( x  =  J  ->  ( +g  `  ( R `  x ) )  =  ( +g  `  ( R `  J )
) )
13 fveq2 5677 . . . 4  |-  ( x  =  J  ->  ( F `  x )  =  ( F `  J ) )
14 fveq2 5677 . . . 4  |-  ( x  =  J  ->  ( G `  x )  =  ( G `  J ) )
1512, 13, 14oveq123d 6081 . . 3  |-  ( x  =  J  ->  (
( F `  x
) ( +g  `  ( R `  x )
) ( G `  x ) )  =  ( ( F `  J ) ( +g  `  ( R `  J
) ) ( G `
 J ) ) )
16 prdsplusgfval.j . . 3  |-  ( ph  ->  J  e.  I )
17 fvexg 5696 . . . . 5  |-  ( ( F  e.  B  /\  J  e.  I )  ->  ( F `  J
)  e.  _V )
186, 16, 17syl2anc 411 . . . 4  |-  ( ph  ->  ( F `  J
)  e.  _V )
19 fnex 5913 . . . . . . 7  |-  ( ( R  Fn  I  /\  I  e.  W )  ->  R  e.  _V )
205, 4, 19syl2anc 411 . . . . . 6  |-  ( ph  ->  R  e.  _V )
21 fvexg 5696 . . . . . 6  |-  ( ( R  e.  _V  /\  J  e.  I )  ->  ( R `  J
)  e.  _V )
2220, 16, 21syl2anc 411 . . . . 5  |-  ( ph  ->  ( R `  J
)  e.  _V )
23 plusgslid 13415 . . . . . 6  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
2423slotex 13329 . . . . 5  |-  ( ( R `  J )  e.  _V  ->  ( +g  `  ( R `  J ) )  e. 
_V )
2522, 24syl 14 . . . 4  |-  ( ph  ->  ( +g  `  ( R `  J )
)  e.  _V )
26 fvexg 5696 . . . . 5  |-  ( ( G  e.  B  /\  J  e.  I )  ->  ( G `  J
)  e.  _V )
277, 16, 26syl2anc 411 . . . 4  |-  ( ph  ->  ( G `  J
)  e.  _V )
28 ovexg 6094 . . . 4  |-  ( ( ( F `  J
)  e.  _V  /\  ( +g  `  ( R `
 J ) )  e.  _V  /\  ( G `  J )  e.  _V )  ->  (
( F `  J
) ( +g  `  ( R `  J )
) ( G `  J ) )  e. 
_V )
2918, 25, 27, 28syl3anc 1274 . . 3  |-  ( ph  ->  ( ( F `  J ) ( +g  `  ( R `  J
) ) ( G `
 J ) )  e.  _V )
3011, 15, 16, 29fvmptd3 5778 . 2  |-  ( ph  ->  ( ( x  e.  I  |->  ( ( F `
 x ) ( +g  `  ( R `
 x ) ) ( G `  x
) ) ) `  J )  =  ( ( F `  J
) ( +g  `  ( R `  J )
) ( G `  J ) ) )
3110, 30eqtrd 2267 1  |-  ( ph  ->  ( ( F  .+  G ) `  J
)  =  ( ( F `  J ) ( +g  `  ( R `  J )
) ( G `  J ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205   _Vcvv 2815    |-> cmpt 4177    Fn wfn 5354   ` cfv 5359  (class class class)co 6060   Basecbs 13302   +g cplusg 13380   X_scprds 14118
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-14 2208  ax-ext 2216  ax-coll 4231  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-cnex 8236  ax-resscn 8237  ax-1cn 8238  ax-1re 8239  ax-icn 8240  ax-addcl 8241  ax-addrcl 8242  ax-mulcl 8243  ax-addcom 8245  ax-mulcom 8246  ax-addass 8247  ax-mulass 8248  ax-distr 8249  ax-i2m1 8250  ax-0lt1 8251  ax-1rid 8252  ax-0id 8253  ax-rnegex 8254  ax-cnre 8256  ax-pre-ltirr 8257  ax-pre-ltwlin 8258  ax-pre-lttrn 8259  ax-pre-apti 8260  ax-pre-ltadd 8261
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3677  df-sn 3701  df-pr 3702  df-tp 3703  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-f 5363  df-f1 5364  df-fo 5365  df-f1o 5366  df-fv 5367  df-riota 6013  df-ov 6063  df-oprab 6064  df-mpo 6065  df-1st 6349  df-2nd 6350  df-map 6899  df-ixp 6949  df-sup 7290  df-pnf 8328  df-mnf 8329  df-xr 8330  df-ltxr 8331  df-le 8332  df-sub 8465  df-neg 8466  df-inn 9260  df-2 9318  df-3 9319  df-4 9320  df-5 9321  df-6 9322  df-7 9323  df-8 9324  df-9 9325  df-n0 9519  df-z 9600  df-dec 9733  df-uz 9877  df-fz 10367  df-struct 13304  df-ndx 13305  df-slot 13306  df-base 13308  df-plusg 13393  df-mulr 13394  df-sca 13396  df-vsca 13397  df-ip 13398  df-tset 13399  df-ple 13400  df-ds 13402  df-hom 13404  df-cco 13405  df-rest 13544  df-topn 13545  df-topgen 13563  df-pt 13564  df-prds 14119
This theorem is referenced by:  prdssgrpd  14140  prdsmndd  14143
  Copyright terms: Public domain W3C validator