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

Theorem off 6315
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 3451 . . . . . . 7  |-  ( A  i^i  B )  C_  A
42, 3eqsstrri 3281 . . . . . 6  |-  C  C_  A
54sseli 3244 . . . . 5  |-  ( z  e.  C  ->  z  e.  A )
6 ffvelcdm 5841 . . . . 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 3452 . . . . . . 7  |-  ( A  i^i  B )  C_  B
102, 9eqsstrri 3281 . . . . . 6  |-  C  C_  B
1110sseli 3244 . . . . 5  |-  ( z  e.  C  ->  z  e.  B )
12 ffvelcdm 5841 . . . . 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 2632 . . . . 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 6092 . . . . . 6  |-  ( x  =  ( F `  z )  ->  (
x R y )  =  ( ( F `
 z ) R y ) )
1817eleq1d 2307 . . . . 5  |-  ( x  =  ( F `  z )  ->  (
( x R y )  e.  U  <->  ( ( F `  z ) R y )  e.  U ) )
19 oveq2 6093 . . . . . 6  |-  ( y  =  ( G `  z )  ->  (
( F `  z
) R y )  =  ( ( F `
 z ) R ( G `  z
) ) )
2019eleq1d 2307 . . . . 5  |-  ( y  =  ( G `  z )  ->  (
( ( F `  z ) R y )  e.  U  <->  ( ( F `  z ) R ( G `  z ) )  e.  U ) )
2118, 20rspc2va 2944 . . . 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 1277 . . 3  |-  ( (
ph  /\  z  e.  C )  ->  (
( F `  z
) R ( G `
 z ) )  e.  U )
23 eqid 2238 . . 3  |-  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) )  =  ( z  e.  C  |->  ( ( F `
 z ) R ( G `  z
) ) )
2422, 23fmptd 5862 . 2  |-  ( ph  ->  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) : C --> U )
25 ffn 5533 . . . . 5  |-  ( F : A --> S  ->  F  Fn  A )
261, 25syl 14 . . . 4  |-  ( ph  ->  F  Fn  A )
27 ffn 5533 . . . . 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 2239 . . . 4  |-  ( (
ph  /\  z  e.  A )  ->  ( F `  z )  =  ( F `  z ) )
32 eqidd 2239 . . . 4  |-  ( (
ph  /\  z  e.  B )  ->  ( G `  z )  =  ( G `  z ) )
3326, 28, 29, 30, 2, 31, 32offval 6310 . . 3  |-  ( ph  ->  ( F  oF R G )  =  ( z  e.  C  |->  ( ( F `  z ) R ( G `  z ) ) ) )
3433feq1d 5520 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528    i^i cin 3219    |-> cmpt 4192    Fn wfn 5372   -->wf 5373   ` cfv 5377  (class class class)co 6085    oFcof 6300
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302
This theorem is used by:  offeq  6316  suppofss1dcl  6504  suppofss2dcl  6505  ofnegsub  9292  lcomf  14664  psrbagaddclfi  15061  psrbagcon  15062  psraddcl  15071  mplsubgfilemcl  15090  dvaddxxbr  15802  dvmulxxbr  15803  dvaddxx  15804  dvmulxx  15805  dviaddf  15806  dvimulf  15807  plyaddlem  15850
  Copyright terms: Public domain W3C validator