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

Theorem fneqeql2 5688
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 5687 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  dom  ( F  i^i  G
)  =  A ) )
2 eqss 3207 . . 3  |-  ( dom  ( F  i^i  G
)  =  A  <->  ( dom  ( F  i^i  G ) 
C_  A  /\  A  C_ 
dom  ( F  i^i  G ) ) )
3 inss1 3392 . . . . . 6  |-  ( F  i^i  G )  C_  F
4 dmss 4876 . . . . . 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 5372 . . . . . 6  |-  ( F  Fn  A  ->  dom  F  =  A )
76adantr 276 . . . . 5  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  F  =  A )
85, 7sseqtrid 3242 . . . 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 1372    i^i cin 3164    C_ wss 3165   dom cdm 4674    Fn wfn 5265
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-iota 5231  df-fun 5272  df-fn 5273  df-fv 5278
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator