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

Theorem eqfnov2 6139
Description: Two operators with the same domain are equal iff their values at each point in the domain are equal. (Contributed by Jeff Madsen, 7-Jun-2010.)
Assertion
Ref Expression
eqfnov2  |-  ( ( F  Fn  ( A  X.  B )  /\  G  Fn  ( A  X.  B ) )  -> 
( F  =  G  <->  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) ) )
Distinct variable groups:    x, A, y   
x, B, y    x, F, y    x, G, y

Proof of Theorem eqfnov2
StepHypRef Expression
1 eqfnov 6138 . 2  |-  ( ( F  Fn  ( A  X.  B )  /\  G  Fn  ( A  X.  B ) )  -> 
( F  =  G  <-> 
( ( A  X.  B )  =  ( A  X.  B )  /\  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) ) ) )
2 simpr 110 . . 3  |-  ( ( ( A  X.  B
)  =  ( A  X.  B )  /\  A. x  e.  A  A. y  e.  B  (
x F y )  =  ( x G y ) )  ->  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) )
3 eqidd 2232 . . . 4  |-  ( A. x  e.  A  A. y  e.  B  (
x F y )  =  ( x G y )  ->  ( A  X.  B )  =  ( A  X.  B
) )
43ancri 324 . . 3  |-  ( A. x  e.  A  A. y  e.  B  (
x F y )  =  ( x G y )  ->  (
( A  X.  B
)  =  ( A  X.  B )  /\  A. x  e.  A  A. y  e.  B  (
x F y )  =  ( x G y ) ) )
52, 4impbii 126 . 2  |-  ( ( ( A  X.  B
)  =  ( A  X.  B )  /\  A. x  e.  A  A. y  e.  B  (
x F y )  =  ( x G y ) )  <->  A. x  e.  A  A. y  e.  B  ( x F y )  =  ( x G y ) )
61, 5bitrdi 196 1  |-  ( ( F  Fn  ( A  X.  B )  /\  G  Fn  ( A  X.  B ) )  -> 
( F  =  G  <->  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 1398   A.wral 2511    X. cxp 4729    Fn wfn 5328  (class class class)co 6028
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031
This theorem is referenced by:  fnmpoovd  6389  tpossym  6485
  Copyright terms: Public domain W3C validator