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

Theorem fnreseql 5690
Description: Two functions are equal on a subset iff their equalizer contains that subset. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Assertion
Ref Expression
fnreseql  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( ( F  |`  X )  =  ( G  |`  X )  <->  X 
C_  dom  ( F  i^i  G ) ) )

Proof of Theorem fnreseql
StepHypRef Expression
1 fnssres 5389 . . . 4  |-  ( ( F  Fn  A  /\  X  C_  A )  -> 
( F  |`  X )  Fn  X )
213adant2 1019 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( F  |`  X )  Fn  X )
3 fnssres 5389 . . . 4  |-  ( ( G  Fn  A  /\  X  C_  A )  -> 
( G  |`  X )  Fn  X )
433adant1 1018 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( G  |`  X )  Fn  X )
5 fneqeql 5688 . . 3  |-  ( ( ( F  |`  X )  Fn  X  /\  ( G  |`  X )  Fn  X )  ->  (
( F  |`  X )  =  ( G  |`  X )  <->  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X ) )
62, 4, 5syl2anc 411 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( ( F  |`  X )  =  ( G  |`  X )  <->  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X ) )
7 resindir 4975 . . . . . 6  |-  ( ( F  i^i  G )  |`  X )  =  ( ( F  |`  X )  i^i  ( G  |`  X ) )
87dmeqi 4879 . . . . 5  |-  dom  (
( F  i^i  G
)  |`  X )  =  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )
9 dmres 4980 . . . . 5  |-  dom  (
( F  i^i  G
)  |`  X )  =  ( X  i^i  dom  ( F  i^i  G ) )
108, 9eqtr3i 2228 . . . 4  |-  dom  (
( F  |`  X )  i^i  ( G  |`  X ) )  =  ( X  i^i  dom  ( F  i^i  G ) )
1110eqeq1i 2213 . . 3  |-  ( dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X  <->  ( X  i^i  dom  ( F  i^i  G ) )  =  X )
12 df-ss 3179 . . 3  |-  ( X 
C_  dom  ( F  i^i  G )  <->  ( X  i^i  dom  ( F  i^i  G ) )  =  X )
1311, 12bitr4i 187 . 2  |-  ( dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X  <->  X  C_  dom  ( F  i^i  G ) )
146, 13bitrdi 196 1  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( ( F  |`  X )  =  ( G  |`  X )  <->  X 
C_  dom  ( F  i^i  G ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 981    = wceq 1373    i^i cin 3165    C_ wss 3166   dom cdm 4675    |` cres 4677    Fn wfn 5266
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-res 4687  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator