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

Theorem fneqeql 5764
Description: Two functions are equal iff their equalizer is the whole domain. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Assertion
Ref Expression
fneqeql  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  dom  ( F  i^i  G
)  =  A ) )

Proof of Theorem fneqeql
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 eqfnfv 5753 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
2 eqcom 2233 . . . 4  |-  ( { x  e.  A  | 
( F `  x
)  =  ( G `
 x ) }  =  A  <->  A  =  { x  e.  A  |  ( F `  x )  =  ( G `  x ) } )
3 rabid2 2711 . . . 4  |-  ( A  =  { x  e.  A  |  ( F `
 x )  =  ( G `  x
) }  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) )
42, 3bitri 184 . . 3  |-  ( { x  e.  A  | 
( F `  x
)  =  ( G `
 x ) }  =  A  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) )
51, 4bitr4di 198 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  { x  e.  A  |  ( F `  x )  =  ( G `  x ) }  =  A ) )
6 fndmin 5763 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  ( F  i^i  G )  =  { x  e.  A  |  ( F `  x )  =  ( G `  x ) } )
76eqeq1d 2240 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( dom  ( F  i^i  G )  =  A  <->  { x  e.  A  |  ( F `  x )  =  ( G `  x ) }  =  A ) )
85, 7bitr4d 191 1  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  dom  ( F  i^i  G
)  =  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   A.wral 2511   {crab 2515    i^i cin 3200   dom cdm 4731    Fn wfn 5328   ` cfv 5333
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-rab 2520  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-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
This theorem is referenced by:  fneqeql2  5765  fnreseql  5766
  Copyright terms: Public domain W3C validator