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

Theorem fneqeql2 5756
Description: Two functions are equal iff their equalizer contains the whole domain. (Contributed by Stefan O'Rear, 9-Mar-2015.)
Assertion
Ref Expression
fneqeql2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <-> 
A  C_  dom  ( F  i^i  G ) ) )

Proof of Theorem fneqeql2
StepHypRef Expression
1 fneqeql 5755 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  dom  ( F  i^i  G
)  =  A ) )
2 eqss 3242 . . 3  |-  ( dom  ( F  i^i  G
)  =  A  <->  ( dom  ( F  i^i  G ) 
C_  A  /\  A  C_ 
dom  ( F  i^i  G ) ) )
3 inss1 3427 . . . . . 6  |-  ( F  i^i  G )  C_  F
4 dmss 4930 . . . . . 6  |-  ( ( F  i^i  G ) 
C_  F  ->  dom  ( F  i^i  G ) 
C_  dom  F )
53, 4ax-mp 5 . . . . 5  |-  dom  ( F  i^i  G )  C_  dom  F
6 fndm 5429 . . . . . 6  |-  ( F  Fn  A  ->  dom  F  =  A )
76adantr 276 . . . . 5  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  F  =  A )
85, 7sseqtrid 3277 . . . 4  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  ( F  i^i  G )  C_  A )
98biantrurd 305 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( A  C_  dom  ( F  i^i  G )  <-> 
( dom  ( F  i^i  G )  C_  A  /\  A  C_  dom  ( F  i^i  G ) ) ) )
102, 9bitr4id 199 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( dom  ( F  i^i  G )  =  A  <->  A  C_  dom  ( F  i^i  G ) ) )
111, 10bitrd 188 1  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <-> 
A  C_  dom  ( F  i^i  G ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    i^i cin 3199    C_ wss 3200   dom cdm 4725    Fn wfn 5321
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator