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

Theorem feq1 5050
Description: Equality theorem for functions. (Contributed by NM, 1-Aug-1994.)
Assertion
Ref Expression
feq1  |-  ( F  =  G  ->  ( F : A --> B  <->  G : A
--> B ) )

Proof of Theorem feq1
StepHypRef Expression
1 fneq1 5007 . . 3  |-  ( F  =  G  ->  ( F  Fn  A  <->  G  Fn  A ) )
2 rneq 4579 . . . 4  |-  ( F  =  G  ->  ran  F  =  ran  G )
32sseq1d 3026 . . 3  |-  ( F  =  G  ->  ( ran  F  C_  B  <->  ran  G  C_  B ) )
41, 3anbi12d 456 . 2  |-  ( F  =  G  ->  (
( F  Fn  A  /\  ran  F  C_  B
)  <->  ( G  Fn  A  /\  ran  G  C_  B ) ) )
5 df-f 4926 . 2  |-  ( F : A --> B  <->  ( F  Fn  A  /\  ran  F  C_  B ) )
6 df-f 4926 . 2  |-  ( G : A --> B  <->  ( G  Fn  A  /\  ran  G  C_  B ) )
74, 5, 63bitr4g 221 1  |-  ( F  =  G  ->  ( F : A --> B  <->  G : A
--> B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    C_ wss 2973   ran crn 4364    Fn wfn 4917   -->wf 4918
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-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-fun 4924  df-fn 4925  df-f 4926
This theorem is referenced by:  feq1d  5054  feq1i  5059  f00  5101  fconstg  5103  f1eq1  5107  fconst2g  5397  ac6sfi  6379  1fv  9149
  Copyright terms: Public domain W3C validator