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

Theorem ov 5890
Description: The value of an operation class abstraction. (Contributed by NM, 16-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Hypotheses
Ref Expression
ov.1  |-  C  e. 
_V
ov.2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ov.3  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
ov.4  |-  ( z  =  C  ->  ( ch 
<->  th ) )
ov.5  |-  ( ( x  e.  R  /\  y  e.  S )  ->  E! z ph )
ov.6  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) }
Assertion
Ref Expression
ov  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( A F B )  =  C  <->  th ) )
Distinct variable groups:    x, y, z, A    x, B, y, z    x, C, y, z    x, R, y, z    x, S, y, z    th, x, y, z
Allowed substitution hints:    ph( x, y, z)    ps( x, y, z)    ch( x, y, z)    F( x, y, z)

Proof of Theorem ov
StepHypRef Expression
1 df-ov 5777 . . . . 5  |-  ( A F B )  =  ( F `  <. A ,  B >. )
2 ov.6 . . . . . 6  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) }
32fveq1i 5422 . . . . 5  |-  ( F `
 <. A ,  B >. )  =  ( {
<. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) } `  <. A ,  B >. )
41, 3eqtri 2160 . . . 4  |-  ( A F B )  =  ( { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  R  /\  y  e.  S )  /\  ph ) } `  <. A ,  B >. )
54eqeq1i 2147 . . 3  |-  ( ( A F B )  =  C  <->  ( { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) } `  <. A ,  B >. )  =  C )
6 ov.5 . . . . . 6  |-  ( ( x  e.  R  /\  y  e.  S )  ->  E! z ph )
76fnoprab 5874 . . . . 5  |-  { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S
)  /\  ph ) }  Fn  { <. x ,  y >.  |  ( x  e.  R  /\  y  e.  S ) }
8 eleq1 2202 . . . . . . . 8  |-  ( x  =  A  ->  (
x  e.  R  <->  A  e.  R ) )
98anbi1d 460 . . . . . . 7  |-  ( x  =  A  ->  (
( x  e.  R  /\  y  e.  S
)  <->  ( A  e.  R  /\  y  e.  S ) ) )
10 eleq1 2202 . . . . . . . 8  |-  ( y  =  B  ->  (
y  e.  S  <->  B  e.  S ) )
1110anbi2d 459 . . . . . . 7  |-  ( y  =  B  ->  (
( A  e.  R  /\  y  e.  S
)  <->  ( A  e.  R  /\  B  e.  S ) ) )
129, 11opelopabg 4190 . . . . . 6  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( <. A ,  B >.  e.  { <. x ,  y >.  |  ( x  e.  R  /\  y  e.  S ) } 
<->  ( A  e.  R  /\  B  e.  S
) ) )
1312ibir 176 . . . . 5  |-  ( ( A  e.  R  /\  B  e.  S )  -> 
<. A ,  B >.  e. 
{ <. x ,  y
>.  |  ( x  e.  R  /\  y  e.  S ) } )
14 fnopfvb 5463 . . . . 5  |-  ( ( { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) }  Fn  { <. x ,  y >.  |  ( x  e.  R  /\  y  e.  S ) }  /\  <. A ,  B >.  e.  { <. x ,  y >.  |  ( x  e.  R  /\  y  e.  S ) } )  ->  (
( { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  R  /\  y  e.  S )  /\  ph ) } `  <. A ,  B >. )  =  C  <->  <. <. A ,  B >. ,  C >.  e. 
{ <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) } ) )
157, 13, 14sylancr 410 . . . 4  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S
)  /\  ph ) } `
 <. A ,  B >. )  =  C  <->  <. <. A ,  B >. ,  C >.  e. 
{ <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) } ) )
16 ov.1 . . . . 5  |-  C  e. 
_V
17 ov.2 . . . . . . 7  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
189, 17anbi12d 464 . . . . . 6  |-  ( x  =  A  ->  (
( ( x  e.  R  /\  y  e.  S )  /\  ph ) 
<->  ( ( A  e.  R  /\  y  e.  S )  /\  ps ) ) )
19 ov.3 . . . . . . 7  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
2011, 19anbi12d 464 . . . . . 6  |-  ( y  =  B  ->  (
( ( A  e.  R  /\  y  e.  S )  /\  ps ) 
<->  ( ( A  e.  R  /\  B  e.  S )  /\  ch ) ) )
21 ov.4 . . . . . . 7  |-  ( z  =  C  ->  ( ch 
<->  th ) )
2221anbi2d 459 . . . . . 6  |-  ( z  =  C  ->  (
( ( A  e.  R  /\  B  e.  S )  /\  ch ) 
<->  ( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
2318, 20, 22eloprabg 5859 . . . . 5  |-  ( ( A  e.  R  /\  B  e.  S  /\  C  e.  _V )  ->  ( <. <. A ,  B >. ,  C >.  e.  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) }  <->  ( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
2416, 23mp3an3 1304 . . . 4  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( <. <. A ,  B >. ,  C >.  e.  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) }  <->  ( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
2515, 24bitrd 187 . . 3  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S
)  /\  ph ) } `
 <. A ,  B >. )  =  C  <->  ( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
265, 25syl5bb 191 . 2  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( A F B )  =  C  <-> 
( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
2726bianabs 600 1  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( A F B )  =  C  <->  th ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480   E!weu 1999   _Vcvv 2686   <.cop 3530   {copab 3988    Fn wfn 5118   ` cfv 5123  (class class class)co 5774   {coprab 5775
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131  df-ov 5777  df-oprab 5778
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator