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

Theorem fvopab3g 5502
Description: Value of a function given by ordered-pair class abstraction. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.)
Hypotheses
Ref Expression
fvopab3g.2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
fvopab3g.3  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
fvopab3g.4  |-  ( x  e.  C  ->  E! y ph )
fvopab3g.5  |-  F  =  { <. x ,  y
>.  |  ( x  e.  C  /\  ph ) }
Assertion
Ref Expression
fvopab3g  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( ( F `  A )  =  B  <->  ch ) )
Distinct variable groups:    x, y, A   
x, B, y    x, C, y    ch, x, y
Allowed substitution hints:    ph( x, y)    ps( x, y)    D( x, y)    F( x, y)

Proof of Theorem fvopab3g
StepHypRef Expression
1 eleq1 2203 . . . 4  |-  ( x  =  A  ->  (
x  e.  C  <->  A  e.  C ) )
2 fvopab3g.2 . . . 4  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
31, 2anbi12d 465 . . 3  |-  ( x  =  A  ->  (
( x  e.  C  /\  ph )  <->  ( A  e.  C  /\  ps )
) )
4 fvopab3g.3 . . . 4  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
54anbi2d 460 . . 3  |-  ( y  =  B  ->  (
( A  e.  C  /\  ps )  <->  ( A  e.  C  /\  ch )
) )
63, 5opelopabg 4198 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( <. A ,  B >.  e.  { <. x ,  y >.  |  ( x  e.  C  /\  ph ) }  <->  ( A  e.  C  /\  ch )
) )
7 fvopab3g.4 . . . . . 6  |-  ( x  e.  C  ->  E! y ph )
8 fvopab3g.5 . . . . . 6  |-  F  =  { <. x ,  y
>.  |  ( x  e.  C  /\  ph ) }
97, 8fnopab 5255 . . . . 5  |-  F  Fn  C
10 fnopfvb 5471 . . . . 5  |-  ( ( F  Fn  C  /\  A  e.  C )  ->  ( ( F `  A )  =  B  <->  <. A ,  B >.  e.  F ) )
119, 10mpan 421 . . . 4  |-  ( A  e.  C  ->  (
( F `  A
)  =  B  <->  <. A ,  B >.  e.  F ) )
128eleq2i 2207 . . . 4  |-  ( <. A ,  B >.  e.  F  <->  <. A ,  B >.  e.  { <. x ,  y >.  |  ( x  e.  C  /\  ph ) } )
1311, 12syl6bb 195 . . 3  |-  ( A  e.  C  ->  (
( F `  A
)  =  B  <->  <. A ,  B >.  e.  { <. x ,  y >.  |  ( x  e.  C  /\  ph ) } ) )
1413adantr 274 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( ( F `  A )  =  B  <->  <. A ,  B >.  e. 
{ <. x ,  y
>.  |  ( x  e.  C  /\  ph ) } ) )
15 ibar 299 . . 3  |-  ( A  e.  C  ->  ( ch 
<->  ( A  e.  C  /\  ch ) ) )
1615adantr 274 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( ch  <->  ( A  e.  C  /\  ch )
) )
176, 14, 163bitr4d 219 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( ( F `  A )  =  B  <->  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1332    e. wcel 1481   E!weu 2000   <.cop 3535   {copab 3996    Fn wfn 5126   ` cfv 5131
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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-iota 5096  df-fun 5133  df-fn 5134  df-fv 5139
This theorem is referenced by:  recmulnqg  7223
  Copyright terms: Public domain W3C validator