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

Theorem eqfnov 5983
Description: Equality of two operations is determined by their values. (Contributed by NM, 1-Sep-2005.)
Assertion
Ref Expression
eqfnov  |-  ( ( F  Fn  ( A  X.  B )  /\  G  Fn  ( C  X.  D ) )  -> 
( F  =  G  <-> 
( ( A  X.  B )  =  ( C  X.  D )  /\  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) ) ) )
Distinct variable groups:    x, y, A   
x, B, y    x, F, y    x, G, y
Allowed substitution hints:    C( x, y)    D( x, y)

Proof of Theorem eqfnov
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 eqfnfv2 5616 . 2  |-  ( ( F  Fn  ( A  X.  B )  /\  G  Fn  ( C  X.  D ) )  -> 
( F  =  G  <-> 
( ( A  X.  B )  =  ( C  X.  D )  /\  A. z  e.  ( A  X.  B
) ( F `  z )  =  ( G `  z ) ) ) )
2 fveq2 5517 . . . . . 6  |-  ( z  =  <. x ,  y
>.  ->  ( F `  z )  =  ( F `  <. x ,  y >. )
)
3 fveq2 5517 . . . . . 6  |-  ( z  =  <. x ,  y
>.  ->  ( G `  z )  =  ( G `  <. x ,  y >. )
)
42, 3eqeq12d 2192 . . . . 5  |-  ( z  =  <. x ,  y
>.  ->  ( ( F `
 z )  =  ( G `  z
)  <->  ( F `  <. x ,  y >.
)  =  ( G `
 <. x ,  y
>. ) ) )
5 df-ov 5880 . . . . . 6  |-  ( x F y )  =  ( F `  <. x ,  y >. )
6 df-ov 5880 . . . . . 6  |-  ( x G y )  =  ( G `  <. x ,  y >. )
75, 6eqeq12i 2191 . . . . 5  |-  ( ( x F y )  =  ( x G y )  <->  ( F `  <. x ,  y
>. )  =  ( G `  <. x ,  y >. ) )
84, 7bitr4di 198 . . . 4  |-  ( z  =  <. x ,  y
>.  ->  ( ( F `
 z )  =  ( G `  z
)  <->  ( x F y )  =  ( x G y ) ) )
98ralxp 4772 . . 3  |-  ( A. z  e.  ( A  X.  B ) ( F `
 z )  =  ( G `  z
)  <->  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) )
109anbi2i 457 . 2  |-  ( ( ( A  X.  B
)  =  ( C  X.  D )  /\  A. z  e.  ( A  X.  B ) ( F `  z )  =  ( G `  z ) )  <->  ( ( A  X.  B )  =  ( C  X.  D
)  /\  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) ) )
111, 10bitrdi 196 1  |-  ( ( F  Fn  ( A  X.  B )  /\  G  Fn  ( C  X.  D ) )  -> 
( F  =  G  <-> 
( ( A  X.  B )  =  ( C  X.  D )  /\  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353   A.wral 2455   <.cop 3597    X. cxp 4626    Fn wfn 5213   ` cfv 5218  (class class class)co 5877
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fn 5221  df-fv 5226  df-ov 5880
This theorem is referenced by:  eqfnov2  5984
  Copyright terms: Public domain W3C validator