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

Theorem fnreseql 5672
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 5371 . . . 4  |-  ( ( F  Fn  A  /\  X  C_  A )  -> 
( F  |`  X )  Fn  X )
213adant2 1018 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( F  |`  X )  Fn  X )
3 fnssres 5371 . . . 4  |-  ( ( G  Fn  A  /\  X  C_  A )  -> 
( G  |`  X )  Fn  X )
433adant1 1017 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A  /\  X  C_  A )  -> 
( G  |`  X )  Fn  X )
5 fneqeql 5670 . . 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 4962 . . . . . 6  |-  ( ( F  i^i  G )  |`  X )  =  ( ( F  |`  X )  i^i  ( G  |`  X ) )
87dmeqi 4867 . . . . 5  |-  dom  (
( F  i^i  G
)  |`  X )  =  dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )
9 dmres 4967 . . . . 5  |-  dom  (
( F  i^i  G
)  |`  X )  =  ( X  i^i  dom  ( F  i^i  G ) )
108, 9eqtr3i 2219 . . . 4  |-  dom  (
( F  |`  X )  i^i  ( G  |`  X ) )  =  ( X  i^i  dom  ( F  i^i  G ) )
1110eqeq1i 2204 . . 3  |-  ( dom  ( ( F  |`  X )  i^i  ( G  |`  X ) )  =  X  <->  ( X  i^i  dom  ( F  i^i  G ) )  =  X )
12 df-ss 3170 . . 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 980    = wceq 1364    i^i cin 3156    C_ wss 3157   dom cdm 4663    |` cres 4665    Fn wfn 5253
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-res 4675  df-iota 5219  df-fun 5260  df-fn 5261  df-fv 5266
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator