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

Theorem prdsplusgcl 13465
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 5470 . . 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 13302 . 2  |-  ( ph  ->  ( F  .+  G
)  =  ( x  e.  I  |->  ( ( F `  x ) ( +g  `  ( R `  x )
) ( G `  x ) ) ) )
115ffvelcdmda 5763 . . . . 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 13301 . . . . 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 13301 . . . . 5  |-  ( (
ph  /\  x  e.  I )  ->  ( G `  x )  e.  ( Base `  ( R `  x )
) )
20 eqid 2229 . . . . . 6  |-  ( Base `  ( R `  x
) )  =  (
Base `  ( R `  x ) )
21 eqid 2229 . . . . . 6  |-  ( +g  `  ( R `  x
) )  =  ( +g  `  ( R `
 x ) )
2220, 21mndcl 13442 . . . . 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 1271 . . . 4  |-  ( (
ph  /\  x  e.  I )  ->  (
( F `  x
) ( +g  `  ( R `  x )
) ( G `  x ) )  e.  ( Base `  ( R `  x )
) )
2423ralrimiva 2603 . . 3  |-  ( ph  ->  A. x  e.  I 
( ( F `  x ) ( +g  `  ( R `  x
) ) ( G `
 x ) )  e.  ( Base `  ( R `  x )
) )
251, 2, 3, 4, 6prdsbasmpt 13299 . . 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 2306 1  |-  ( ph  ->  ( F  .+  G
)  e.  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   A.wral 2508    |-> cmpt 4144    Fn wfn 5309   -->wf 5310   ` cfv 5314  (class class class)co 5994   Basecbs 13018   +g cplusg 13096   X_scprds 13284   Mndcmnd 13435
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4521  ax-setind 4626  ax-cnex 8078  ax-resscn 8079  ax-1cn 8080  ax-1re 8081  ax-icn 8082  ax-addcl 8083  ax-addrcl 8084  ax-mulcl 8085  ax-addcom 8087  ax-mulcom 8088  ax-addass 8089  ax-mulass 8090  ax-distr 8091  ax-i2m1 8092  ax-0lt1 8093  ax-1rid 8094  ax-0id 8095  ax-rnegex 8096  ax-cnre 8098  ax-pre-ltirr 8099  ax-pre-ltwlin 8100  ax-pre-lttrn 8101  ax-pre-apti 8102  ax-pre-ltadd 8103
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-tp 3674  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4381  df-xp 4722  df-rel 4723  df-cnv 4724  df-co 4725  df-dm 4726  df-rn 4727  df-res 4728  df-ima 4729  df-iota 5274  df-fun 5316  df-fn 5317  df-f 5318  df-f1 5319  df-fo 5320  df-f1o 5321  df-fv 5322  df-riota 5947  df-ov 5997  df-oprab 5998  df-mpo 5999  df-1st 6276  df-2nd 6277  df-map 6787  df-ixp 6836  df-sup 7139  df-pnf 8171  df-mnf 8172  df-xr 8173  df-ltxr 8174  df-le 8175  df-sub 8307  df-neg 8308  df-inn 9099  df-2 9157  df-3 9158  df-4 9159  df-5 9160  df-6 9161  df-7 9162  df-8 9163  df-9 9164  df-n0 9358  df-z 9435  df-dec 9567  df-uz 9711  df-fz 10193  df-struct 13020  df-ndx 13021  df-slot 13022  df-base 13024  df-plusg 13109  df-mulr 13110  df-sca 13112  df-vsca 13113  df-ip 13114  df-tset 13115  df-ple 13116  df-ds 13118  df-hom 13120  df-cco 13121  df-rest 13260  df-topn 13261  df-topgen 13279  df-pt 13280  df-prds 13286  df-mgm 13375  df-sgrp 13421  df-mnd 13436
This theorem is referenced by:  prdsmndd  13467
  Copyright terms: Public domain W3C validator