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

Theorem off 6143
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  oF 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 3379 . . . . . . 7  |-  ( A  i^i  B )  C_  A
42, 3eqsstrri 3212 . . . . . 6  |-  C  C_  A
54sseli 3175 . . . . 5  |-  ( z  e.  C  ->  z  e.  A )
6 ffvelcdm 5691 . . . . 5  |-  ( ( F : A --> S  /\  z  e.  A )  ->  ( F `  z
)  e.  S )
71, 5, 6syl2an 289 . . . 4  |-  ( (
ph  /\  z  e.  C )  ->  ( F `  z )  e.  S )
8 off.3 . . . . 5  |-  ( ph  ->  G : B --> T )
9 inss2 3380 . . . . . . 7  |-  ( A  i^i  B )  C_  B
102, 9eqsstrri 3212 . . . . . 6  |-  C  C_  B
1110sseli 3175 . . . . 5  |-  ( z  e.  C  ->  z  e.  B )
12 ffvelcdm 5691 . . . . 5  |-  ( ( G : B --> T  /\  z  e.  B )  ->  ( G `  z
)  e.  T )
138, 11, 12syl2an 289 . . . 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 2576 . . . . 5  |-  ( ph  ->  A. x  e.  S  A. y  e.  T  ( x R y )  e.  U )
1615adantr 276 . . . 4  |-  ( (
ph  /\  z  e.  C )  ->  A. x  e.  S  A. y  e.  T  ( x R y )  e.  U )
17 oveq1 5925 . . . . . 6  |-  ( x  =  ( F `  z )  ->  (
x R y )  =  ( ( F `
 z ) R y ) )
1817eleq1d 2262 . . . . 5  |-  ( x  =  ( F `  z )  ->  (
( x R y )  e.  U  <->  ( ( F `  z ) R y )  e.  U ) )
19 oveq2 5926 . . . . . 6  |-  ( y  =  ( G `  z )  ->  (
( F `  z
) R y )  =  ( ( F `
 z ) R ( G `  z
) ) )
2019eleq1d 2262 . . . . 5  |-  ( y  =  ( G `  z )  ->  (
( ( F `  z ) R y )  e.  U  <->  ( ( F `  z ) R ( G `  z ) )  e.  U ) )
2118, 20rspc2va 2878 . . . 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 1248 . . 3  |-  ( (
ph  /\  z  e.  C )  ->  (
( F `  z
) R ( G `
 z ) )  e.  U )
23 eqid 2193 . . 3  |-  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) )  =  ( z  e.  C  |->  ( ( F `
 z ) R ( G `  z
) ) )
2422, 23fmptd 5712 . 2  |-  ( ph  ->  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) : C --> U )
25 ffn 5403 . . . . 5  |-  ( F : A --> S  ->  F  Fn  A )
261, 25syl 14 . . . 4  |-  ( ph  ->  F  Fn  A )
27 ffn 5403 . . . . 5  |-  ( G : B --> T  ->  G  Fn  B )
288, 27syl 14 . . . 4  |-  ( ph  ->  G  Fn  B )
29 off.4 . . . 4  |-  ( ph  ->  A  e.  V )
30 off.5 . . . 4  |-  ( ph  ->  B  e.  W )
31 eqidd 2194 . . . 4  |-  ( (
ph  /\  z  e.  A )  ->  ( F `  z )  =  ( F `  z ) )
32 eqidd 2194 . . . 4  |-  ( (
ph  /\  z  e.  B )  ->  ( G `  z )  =  ( G `  z ) )
3326, 28, 29, 30, 2, 31, 32offval 6138 . . 3  |-  ( ph  ->  ( F  oF R G )  =  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) )
3433feq1d 5390 . 2  |-  ( ph  ->  ( ( F  oF R G ) : C --> U  <->  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) : C --> U ) )
3524, 34mpbird 167 1  |-  ( ph  ->  ( F  oF R G ) : C --> U )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2164   A.wral 2472    i^i cin 3152    |-> cmpt 4090    Fn wfn 5249   -->wf 5250   ` cfv 5254  (class class class)co 5918    oFcof 6128
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-setind 4569
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-of 6130
This theorem is referenced by:  offeq  6144  ofnegsub  8981  lcomf  13823  psraddcl  14164  dvaddxxbr  14850  dvmulxxbr  14851  dvaddxx  14852  dvmulxx  14853  dviaddf  14854  dvimulf  14855  plyaddlem  14895
  Copyright terms: Public domain W3C validator