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

Theorem prdsplusgcl 13743
Description: Structure product pointwise sums are closed when the factors are monoids. (Contributed by Stefan O'Rear, 10-Jan-2015.)
Hypotheses
Ref Expression
prdsplusgcl.y  |-  Y  =  ( S X_s R )
prdsplusgcl.b  |-  B  =  ( Base `  Y
)
prdsplusgcl.p  |-  .+  =  ( +g  `  Y )
prdsplusgcl.s  |-  ( ph  ->  S  e.  V )
prdsplusgcl.i  |-  ( ph  ->  I  e.  W )
prdsplusgcl.r  |-  ( ph  ->  R : I --> Mnd )
prdsplusgcl.f  |-  ( ph  ->  F  e.  B )
prdsplusgcl.g  |-  ( ph  ->  G  e.  B )
Assertion
Ref Expression
prdsplusgcl  |-  ( ph  ->  ( F  .+  G
)  e.  B )

Proof of Theorem prdsplusgcl
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 prdsplusgcl.y . . 3  |-  Y  =  ( S X_s R )
2 prdsplusgcl.b . . 3  |-  B  =  ( Base `  Y
)
3 prdsplusgcl.s . . 3  |-  ( ph  ->  S  e.  V )
4 prdsplusgcl.i . . 3  |-  ( ph  ->  I  e.  W )
5 prdsplusgcl.r . . . 4  |-  ( ph  ->  R : I --> Mnd )
65ffnd 5514 . . 3  |-  ( ph  ->  R  Fn  I )
7 prdsplusgcl.f . . 3  |-  ( ph  ->  F  e.  B )
8 prdsplusgcl.g . . 3  |-  ( ph  ->  G  e.  B )
9 prdsplusgcl.p . . 3  |-  .+  =  ( +g  `  Y )
101, 2, 3, 4, 6, 7, 8, 9prdsplusgval 13580 . 2  |-  ( ph  ->  ( F  .+  G
)  =  ( x  e.  I  |->  ( ( F `  x ) ( +g  `  ( R `  x )
) ( G `  x ) ) ) )
115ffvelcdmda 5817 . . . . 5  |-  ( (
ph  /\  x  e.  I )  ->  ( R `  x )  e.  Mnd )
123adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  I )  ->  S  e.  V )
134adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  I )  ->  I  e.  W )
146adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  I )  ->  R  Fn  I )
157adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  I )  ->  F  e.  B )
16 simpr 110 . . . . . 6  |-  ( (
ph  /\  x  e.  I )  ->  x  e.  I )
171, 2, 12, 13, 14, 15, 16prdsbasprj 13579 . . . . 5  |-  ( (
ph  /\  x  e.  I )  ->  ( F `  x )  e.  ( Base `  ( R `  x )
) )
188adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  I )  ->  G  e.  B )
191, 2, 12, 13, 14, 18, 16prdsbasprj 13579 . . . . 5  |-  ( (
ph  /\  x  e.  I )  ->  ( G `  x )  e.  ( Base `  ( R `  x )
) )
20 eqid 2234 . . . . . 6  |-  ( Base `  ( R `  x
) )  =  (
Base `  ( R `  x ) )
21 eqid 2234 . . . . . 6  |-  ( +g  `  ( R `  x
) )  =  ( +g  `  ( R `
 x ) )
2220, 21mndcl 13720 . . . . 5  |-  ( ( ( R `  x
)  e.  Mnd  /\  ( F `  x )  e.  ( Base `  ( R `  x )
)  /\  ( G `  x )  e.  (
Base `  ( R `  x ) ) )  ->  ( ( F `
 x ) ( +g  `  ( R `
 x ) ) ( G `  x
) )  e.  (
Base `  ( R `  x ) ) )
2311, 17, 19, 22syl3anc 1274 . . . 4  |-  ( (
ph  /\  x  e.  I )  ->  (
( F `  x
) ( +g  `  ( R `  x )
) ( G `  x ) )  e.  ( Base `  ( R `  x )
) )
2423ralrimiva 2617 . . 3  |-  ( ph  ->  A. x  e.  I 
( ( F `  x ) ( +g  `  ( R `  x
) ) ( G `
 x ) )  e.  ( Base `  ( R `  x )
) )
251, 2, 3, 4, 6prdsbasmpt 13577 . . 3  |-  ( ph  ->  ( ( x  e.  I  |->  ( ( F `
 x ) ( +g  `  ( R `
 x ) ) ( G `  x
) ) )  e.  B  <->  A. x  e.  I 
( ( F `  x ) ( +g  `  ( R `  x
) ) ( G `
 x ) )  e.  ( Base `  ( R `  x )
) ) )
2624, 25mpbird 167 . 2  |-  ( ph  ->  ( x  e.  I  |->  ( ( F `  x ) ( +g  `  ( R `  x
) ) ( G `
 x ) ) )  e.  B )
2710, 26eqeltrd 2311 1  |-  ( ph  ->  ( F  .+  G
)  e.  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522    |-> cmpt 4176    Fn wfn 5352   -->wf 5353   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   X_scprds 13562   Mndcmnd 13713
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259
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 3676  df-sn 3700  df-pr 3701  df-tp 3702  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-map 6897  df-ixp 6947  df-sup 7288  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-z 9595  df-dec 9728  df-uz 9872  df-fz 10362  df-struct 13298  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-mulr 13388  df-sca 13390  df-vsca 13391  df-ip 13392  df-tset 13393  df-ple 13394  df-ds 13396  df-hom 13398  df-cco 13399  df-rest 13538  df-topn 13539  df-topgen 13557  df-pt 13558  df-prds 13564  df-mgm 13653  df-sgrp 13699  df-mnd 13714
This theorem is referenced by:  prdsmndd  13745
  Copyright terms: Public domain W3C validator