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

Theorem ofrfval 6058
Description: Value of a relation applied to two functions. (Contributed by Mario Carneiro, 28-Jul-2014.)
Hypotheses
Ref Expression
offval.1  |-  ( ph  ->  F  Fn  A )
offval.2  |-  ( ph  ->  G  Fn  B )
offval.3  |-  ( ph  ->  A  e.  V )
offval.4  |-  ( ph  ->  B  e.  W )
offval.5  |-  ( A  i^i  B )  =  S
offval.6  |-  ( (
ph  /\  x  e.  A )  ->  ( F `  x )  =  C )
offval.7  |-  ( (
ph  /\  x  e.  B )  ->  ( G `  x )  =  D )
Assertion
Ref Expression
ofrfval  |-  ( ph  ->  ( F  oR R G  <->  A. x  e.  S  C R D ) )
Distinct variable groups:    x, A    x, F    x, G    ph, x    x, S    x, R
Allowed substitution hints:    B( x)    C( x)    D( x)    V( x)    W( x)

Proof of Theorem ofrfval
Dummy variables  f  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 offval.1 . . . 4  |-  ( ph  ->  F  Fn  A )
2 offval.3 . . . 4  |-  ( ph  ->  A  e.  V )
3 fnex 5707 . . . 4  |-  ( ( F  Fn  A  /\  A  e.  V )  ->  F  e.  _V )
41, 2, 3syl2anc 409 . . 3  |-  ( ph  ->  F  e.  _V )
5 offval.2 . . . 4  |-  ( ph  ->  G  Fn  B )
6 offval.4 . . . 4  |-  ( ph  ->  B  e.  W )
7 fnex 5707 . . . 4  |-  ( ( G  Fn  B  /\  B  e.  W )  ->  G  e.  _V )
85, 6, 7syl2anc 409 . . 3  |-  ( ph  ->  G  e.  _V )
9 dmeq 4804 . . . . . 6  |-  ( f  =  F  ->  dom  f  =  dom  F )
10 dmeq 4804 . . . . . 6  |-  ( g  =  G  ->  dom  g  =  dom  G )
119, 10ineqan12d 3325 . . . . 5  |-  ( ( f  =  F  /\  g  =  G )  ->  ( dom  f  i^i 
dom  g )  =  ( dom  F  i^i  dom 
G ) )
12 fveq1 5485 . . . . . 6  |-  ( f  =  F  ->  (
f `  x )  =  ( F `  x ) )
13 fveq1 5485 . . . . . 6  |-  ( g  =  G  ->  (
g `  x )  =  ( G `  x ) )
1412, 13breqan12d 3998 . . . . 5  |-  ( ( f  =  F  /\  g  =  G )  ->  ( ( f `  x ) R ( g `  x )  <-> 
( F `  x
) R ( G `
 x ) ) )
1511, 14raleqbidv 2673 . . . 4  |-  ( ( f  =  F  /\  g  =  G )  ->  ( A. x  e.  ( dom  f  i^i 
dom  g ) ( f `  x ) R ( g `  x )  <->  A. x  e.  ( dom  F  i^i  dom 
G ) ( F `
 x ) R ( G `  x
) ) )
16 df-ofr 6051 . . . 4  |-  oR R  =  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) R ( g `
 x ) }
1715, 16brabga 4242 . . 3  |-  ( ( F  e.  _V  /\  G  e.  _V )  ->  ( F  oR R G  <->  A. x  e.  ( dom  F  i^i  dom 
G ) ( F `
 x ) R ( G `  x
) ) )
184, 8, 17syl2anc 409 . 2  |-  ( ph  ->  ( F  oR R G  <->  A. x  e.  ( dom  F  i^i  dom 
G ) ( F `
 x ) R ( G `  x
) ) )
19 fndm 5287 . . . . . 6  |-  ( F  Fn  A  ->  dom  F  =  A )
201, 19syl 14 . . . . 5  |-  ( ph  ->  dom  F  =  A )
21 fndm 5287 . . . . . 6  |-  ( G  Fn  B  ->  dom  G  =  B )
225, 21syl 14 . . . . 5  |-  ( ph  ->  dom  G  =  B )
2320, 22ineq12d 3324 . . . 4  |-  ( ph  ->  ( dom  F  i^i  dom 
G )  =  ( A  i^i  B ) )
24 offval.5 . . . 4  |-  ( A  i^i  B )  =  S
2523, 24eqtrdi 2215 . . 3  |-  ( ph  ->  ( dom  F  i^i  dom 
G )  =  S )
2625raleqdv 2667 . 2  |-  ( ph  ->  ( A. x  e.  ( dom  F  i^i  dom 
G ) ( F `
 x ) R ( G `  x
)  <->  A. x  e.  S  ( F `  x ) R ( G `  x ) ) )
27 inss1 3342 . . . . . . 7  |-  ( A  i^i  B )  C_  A
2824, 27eqsstrri 3175 . . . . . 6  |-  S  C_  A
2928sseli 3138 . . . . 5  |-  ( x  e.  S  ->  x  e.  A )
30 offval.6 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  ( F `  x )  =  C )
3129, 30sylan2 284 . . . 4  |-  ( (
ph  /\  x  e.  S )  ->  ( F `  x )  =  C )
32 inss2 3343 . . . . . . 7  |-  ( A  i^i  B )  C_  B
3324, 32eqsstrri 3175 . . . . . 6  |-  S  C_  B
3433sseli 3138 . . . . 5  |-  ( x  e.  S  ->  x  e.  B )
35 offval.7 . . . . 5  |-  ( (
ph  /\  x  e.  B )  ->  ( G `  x )  =  D )
3634, 35sylan2 284 . . . 4  |-  ( (
ph  /\  x  e.  S )  ->  ( G `  x )  =  D )
3731, 36breq12d 3995 . . 3  |-  ( (
ph  /\  x  e.  S )  ->  (
( F `  x
) R ( G `
 x )  <->  C R D ) )
3837ralbidva 2462 . 2  |-  ( ph  ->  ( A. x  e.  S  ( F `  x ) R ( G `  x )  <->  A. x  e.  S  C R D ) )
3918, 26, 383bitrd 213 1  |-  ( ph  ->  ( F  oR R G  <->  A. x  e.  S  C R D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   A.wral 2444   _Vcvv 2726    i^i cin 3115   class class class wbr 3982   dom cdm 4604    Fn wfn 5183   ` cfv 5188    oRcofr 6049
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ofr 6051
This theorem is referenced by:  ofrval  6060  ofrfval2  6066  caofref  6071  caofrss  6074  caoftrn  6075
  Copyright terms: Public domain W3C validator