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

Theorem fneqeql2 5752
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 5751 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  dom  ( F  i^i  G
)  =  A ) )
2 eqss 3240 . . 3  |-  ( dom  ( F  i^i  G
)  =  A  <->  ( dom  ( F  i^i  G ) 
C_  A  /\  A  C_ 
dom  ( F  i^i  G ) ) )
3 inss1 3425 . . . . . 6  |-  ( F  i^i  G )  C_  F
4 dmss 4928 . . . . . 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 5426 . . . . . 6  |-  ( F  Fn  A  ->  dom  F  =  A )
76adantr 276 . . . . 5  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  dom  F  =  A )
85, 7sseqtrid 3275 . . . 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 1395    i^i cin 3197    C_ wss 3198   dom cdm 4723    Fn wfn 5319
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator