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

Theorem fneqeql 5528
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 5518 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
2 eqcom 2141 . . . 4  |-  ( { x  e.  A  | 
( F `  x
)  =  ( G `
 x ) }  =  A  <->  A  =  { x  e.  A  |  ( F `  x )  =  ( G `  x ) } )
3 rabid2 2607 . . . 4  |-  ( A  =  { x  e.  A  |  ( F `
 x )  =  ( G `  x
) }  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) )
42, 3bitri 183 . . 3  |-  ( { x  e.  A  | 
( F `  x
)  =  ( G `
 x ) }  =  A  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) )
51, 4syl6bbr 197 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  { x  e.  A  |  ( F `  x )  =  ( G `  x ) }  =  A ) )
6 fndmin 5527 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  ( F  i^i  G )  =  { x  e.  A  |  ( F `  x )  =  ( G `  x ) } )
76eqeq1d 2148 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( dom  ( F  i^i  G )  =  A  <->  { x  e.  A  |  ( F `  x )  =  ( G `  x ) }  =  A ) )
85, 7bitr4d 190 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 103    <-> wb 104    = wceq 1331   A.wral 2416   {crab 2420    i^i cin 3070   dom cdm 4539    Fn wfn 5118   ` cfv 5123
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131
This theorem is referenced by:  fneqeql2  5529  fnreseql  5530
  Copyright terms: Public domain W3C validator