MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  off Unicode version

Theorem off 6093
Description: The function operation produces a function. (Contributed by Mario Carneiro, 20-Jul-2014.)
Hypotheses
Ref Expression
off.1  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  T ) )  -> 
( x R y )  e.  U )
off.2  |-  ( ph  ->  F : A --> S )
off.3  |-  ( ph  ->  G : B --> T )
off.4  |-  ( ph  ->  A  e.  V )
off.5  |-  ( ph  ->  B  e.  W )
off.6  |-  ( A  i^i  B )  =  C
Assertion
Ref Expression
off  |-  ( ph  ->  ( F  o F R G ) : C --> U )
Distinct variable groups:    y, G    x, y, ph    x, S, y   
x, T, y    x, F, y    x, R, y   
x, U, y
Allowed substitution hints:    A( x, y)    B( x, y)    C( x, y)    G( x)    V( x, y)    W( x, y)

Proof of Theorem off
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 off.2 . . . . 5  |-  ( ph  ->  F : A --> S )
2 off.6 . . . . . . 7  |-  ( A  i^i  B )  =  C
3 inss1 3389 . . . . . . 7  |-  ( A  i^i  B )  C_  A
42, 3eqsstr3i 3209 . . . . . 6  |-  C  C_  A
54sseli 3176 . . . . 5  |-  ( z  e.  C  ->  z  e.  A )
6 ffvelrn 5663 . . . . 5  |-  ( ( F : A --> S  /\  z  e.  A )  ->  ( F `  z
)  e.  S )
71, 5, 6syl2an 463 . . . 4  |-  ( (
ph  /\  z  e.  C )  ->  ( F `  z )  e.  S )
8 off.3 . . . . 5  |-  ( ph  ->  G : B --> T )
9 inss2 3390 . . . . . . 7  |-  ( A  i^i  B )  C_  B
102, 9eqsstr3i 3209 . . . . . 6  |-  C  C_  B
1110sseli 3176 . . . . 5  |-  ( z  e.  C  ->  z  e.  B )
12 ffvelrn 5663 . . . . 5  |-  ( ( G : B --> T  /\  z  e.  B )  ->  ( G `  z
)  e.  T )
138, 11, 12syl2an 463 . . . 4  |-  ( (
ph  /\  z  e.  C )  ->  ( G `  z )  e.  T )
14 off.1 . . . . . 6  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  T ) )  -> 
( x R y )  e.  U )
1514ralrimivva 2635 . . . . 5  |-  ( ph  ->  A. x  e.  S  A. y  e.  T  ( x R y )  e.  U )
1615adantr 451 . . . 4  |-  ( (
ph  /\  z  e.  C )  ->  A. x  e.  S  A. y  e.  T  ( x R y )  e.  U )
17 oveq1 5865 . . . . . 6  |-  ( x  =  ( F `  z )  ->  (
x R y )  =  ( ( F `
 z ) R y ) )
1817eleq1d 2349 . . . . 5  |-  ( x  =  ( F `  z )  ->  (
( x R y )  e.  U  <->  ( ( F `  z ) R y )  e.  U ) )
19 oveq2 5866 . . . . . 6  |-  ( y  =  ( G `  z )  ->  (
( F `  z
) R y )  =  ( ( F `
 z ) R ( G `  z
) ) )
2019eleq1d 2349 . . . . 5  |-  ( y  =  ( G `  z )  ->  (
( ( F `  z ) R y )  e.  U  <->  ( ( F `  z ) R ( G `  z ) )  e.  U ) )
2118, 20rspc2va 2891 . . . 4  |-  ( ( ( ( F `  z )  e.  S  /\  ( G `  z
)  e.  T )  /\  A. x  e.  S  A. y  e.  T  ( x R y )  e.  U
)  ->  ( ( F `  z ) R ( G `  z ) )  e.  U )
227, 13, 16, 21syl21anc 1181 . . 3  |-  ( (
ph  /\  z  e.  C )  ->  (
( F `  z
) R ( G `
 z ) )  e.  U )
23 eqid 2283 . . 3  |-  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) )  =  ( z  e.  C  |->  ( ( F `
 z ) R ( G `  z
) ) )
2422, 23fmptd 5684 . 2  |-  ( ph  ->  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) : C --> U )
25 ffn 5389 . . . . 5  |-  ( F : A --> S  ->  F  Fn  A )
261, 25syl 15 . . . 4  |-  ( ph  ->  F  Fn  A )
27 ffn 5389 . . . . 5  |-  ( G : B --> T  ->  G  Fn  B )
288, 27syl 15 . . . 4  |-  ( ph  ->  G  Fn  B )
29 off.4 . . . 4  |-  ( ph  ->  A  e.  V )
30 off.5 . . . 4  |-  ( ph  ->  B  e.  W )
31 eqidd 2284 . . . 4  |-  ( (
ph  /\  z  e.  A )  ->  ( F `  z )  =  ( F `  z ) )
32 eqidd 2284 . . . 4  |-  ( (
ph  /\  z  e.  B )  ->  ( G `  z )  =  ( G `  z ) )
3326, 28, 29, 30, 2, 31, 32offval 6085 . . 3  |-  ( ph  ->  ( F  o F R G )  =  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) )
3433feq1d 5379 . 2  |-  ( ph  ->  ( ( F  o F R G ) : C --> U  <->  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) : C --> U ) )
3524, 34mpbird 223 1  |-  ( ph  ->  ( F  o F R G ) : C --> U )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   A.wral 2543    i^i cin 3151    e. cmpt 4077    Fn wfn 5250   -->wf 5251   ` cfv 5255  (class class class)co 5858    o Fcof 6076
This theorem is referenced by:  o1of2  12086  ghmplusg  15138  gsumzaddlem  15203  gsumzadd  15204  psrbagaddcl  16116  psraddcl  16128  psrvscacl  16138  psrbagev1  16247  tsmsadd  17829  mbfmulc2lem  19002  mbfaddlem  19015  i1fadd  19050  i1fmul  19051  itg1addlem4  19054  i1fmulclem  19057  i1fmulc  19058  mbfi1flimlem  19077  itg2mulclem  19101  itg2mulc  19102  itg2monolem1  19105  itg2addlem  19113  dvaddbr  19287  dvmulbr  19288  dvaddf  19291  dvmulf  19292  dv11cn  19348  evlslem3  19398  plyaddlem  19597  coeeulem  19606  coeaddlem  19630  plydivlem4  19676  jensenlem2  20282  jensen  20283  basellem7  20324  basellem9  20326  dchrmulcl  20488  lcomf  26179  mzpclall  26217  mzpindd  26236  frlmup1  26662  mndvcl  26858  expgrowth  26964  lfladdcl  28634  lflvscl  28640
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-of 6078
  Copyright terms: Public domain W3C validator