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

Theorem fnreseql 5298
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 5032 . . . 4  |-  ( ( F  Fn  A  /\  X  C_  A )  -> 
( F  |`  X )  Fn  X )
213adant2 957 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( F  |`  X )  Fn  X )
3 fnssres 5032 . . . 4  |-  ( ( G  Fn  A  /\  X  C_  A )  -> 
( G  |`  X )  Fn  X )
433adant1 956 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( G  |`  X )  Fn  X )
5 fneqeql 5296 . . 3  |-  ( ( ( F  |`  X )  Fn  X  /\  ( G  |`  X )  Fn  X )  ->  (
( F  |`  X )  =  ( G  |`  X )  <->  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X ) )
62, 4, 5syl2anc 403 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( ( F  |`  X )  =  ( G  |`  X )  <->  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X ) )
7 resindir 4646 . . . . . 6  |-  ( ( F  i^i  G )  |`  X )  =  ( ( F  |`  X )  i^i  ( G  |`  X ) )
87dmeqi 4554 . . . . 5  |-  dom  (
( F  i^i  G
)  |`  X )  =  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )
9 dmres 4650 . . . . 5  |-  dom  (
( F  i^i  G
)  |`  X )  =  ( X  i^i  dom  ( F  i^i  G ) )
108, 9eqtr3i 2103 . . . 4  |-  dom  (
( F  |`  X )  i^i  ( G  |`  X ) )  =  ( X  i^i  dom  ( F  i^i  G ) )
1110eqeq1i 2088 . . 3  |-  ( dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X  <->  ( X  i^i  dom  ( F  i^i  G ) )  =  X )
12 df-ss 2986 . . 3  |-  ( X 
C_  dom  ( F  i^i  G )  <->  ( X  i^i  dom  ( F  i^i  G ) )  =  X )
1311, 12bitr4i 185 . 2  |-  ( dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X  <->  X  C_  dom  ( F  i^i  G ) )
146, 13syl6bb 194 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 103    /\ w3a 919    = wceq 1284    i^i cin 2972    C_ wss 2973   dom cdm 4363    |` cres 4365    Fn wfn 4917
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-res 4375  df-iota 4887  df-fun 4924  df-fn 4925  df-fv 4930
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator