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

Theorem ov 6208
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 6088 . . . . 5  |-  ( A F B )  =  ( F `  <. A ,  B >. )
2 ov.6 . . . . . 6  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) }
32fveq1i 5696 . . . . 5  |-  ( F `
 <. A ,  B >. )  =  ( {
<. <. x ,  y
>. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S )  /\  ph ) } `  <. A ,  B >. )
41, 3eqtri 2259 . . . 4  |-  ( A F B )  =  ( { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  R  /\  y  e.  S )  /\  ph ) } `  <. A ,  B >. )
54eqeq1i 2246 . . 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 6191 . . . . 5  |-  { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  R  /\  y  e.  S
)  /\  ph ) }  Fn  { <. x ,  y >.  |  ( x  e.  R  /\  y  e.  S ) }
8 eleq1 2301 . . . . . . . 8  |-  ( x  =  A  ->  (
x  e.  R  <->  A  e.  R ) )
98anbi1d 469 . . . . . . 7  |-  ( x  =  A  ->  (
( x  e.  R  /\  y  e.  S
)  <->  ( A  e.  R  /\  y  e.  S ) ) )
10 eleq1 2301 . . . . . . . 8  |-  ( y  =  B  ->  (
y  e.  S  <->  B  e.  S ) )
1110anbi2d 468 . . . . . . 7  |-  ( y  =  B  ->  (
( A  e.  R  /\  y  e.  S
)  <->  ( A  e.  R  /\  B  e.  S ) ) )
129, 11opelopabg 4410 . . . . . 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 177 . . . . 5  |-  ( ( A  e.  R  /\  B  e.  S )  -> 
<. A ,  B >.  e. 
{ <. x ,  y
>.  |  ( x  e.  R  /\  y  e.  S ) } )
14 fnopfvb 5742 . . . . 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 418 . . . 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 477 . . . . . 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 477 . . . . . 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 468 . . . . . 6  |-  ( z  =  C  ->  (
( ( A  e.  R  /\  B  e.  S )  /\  ch ) 
<->  ( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
2318, 20, 22eloprabg 6176 . . . . 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 1367 . . . 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 188 . . 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, 25bitrid 192 . 2  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( A F B )  =  C  <-> 
( ( A  e.  R  /\  B  e.  S )  /\  th ) ) )
2726bianabs 619 1  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( A F B )  =  C  <->  th ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   E!weu 2086    e. wcel 2209   _Vcvv 2821   <.cop 3712   {copab 4191    Fn wfn 5372   ` cfv 5377  (class class class)co 6085   {coprab 6086
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  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-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator