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

Theorem fneqeql 5817
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 5806 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
2 eqcom 2240 . . . 4  |-  ( { x  e.  A  | 
( F `  x
)  =  ( G `
 x ) }  =  A  <->  A  =  { x  e.  A  |  ( F `  x )  =  ( G `  x ) } )
3 rabid2 2729 . . . 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 5816 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  ( F  i^i  G )  =  { x  e.  A  |  ( F `  x )  =  ( G `  x ) } )
76eqeq1d 2247 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   A.wral 2528   {crab 2532    i^i cin 3219   dom cdm 4774    Fn wfn 5372   ` cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385
This theorem is used by:  fneqeql2  5818  fnreseql  5819
  Copyright terms: Public domain W3C validator