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

Theorem f1eq3 5590
Description: Equality theorem for one-to-one functions. (Contributed by NM, 10-Feb-1997.)
Assertion
Ref Expression
f1eq3  |-  ( A  =  B  ->  ( F : C -1-1-> A  <->  F : C -1-1-> B ) )

Proof of Theorem f1eq3
StepHypRef Expression
1 feq3 5513 . . 3  |-  ( A  =  B  ->  ( F : C --> A  <->  F : C
--> B ) )
21anbi1d 469 . 2  |-  ( A  =  B  ->  (
( F : C --> A  /\  Fun  `' F
)  <->  ( F : C
--> B  /\  Fun  `' F ) ) )
3 df-f1 5377 . 2  |-  ( F : C -1-1-> A  <->  ( F : C --> A  /\  Fun  `' F ) )
4 df-f1 5377 . 2  |-  ( F : C -1-1-> B  <->  ( F : C --> B  /\  Fun  `' F ) )
52, 3, 43bitr4g 223 1  |-  ( A  =  B  ->  ( F : C -1-1-> A  <->  F : C -1-1-> B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   `'ccnv 4768   Fun wfun 5366   -->wf 5368   -1-1->wf1 5369
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-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-in 3226  df-ss 3233  df-f 5376  df-f1 5377
This theorem is referenced by:  f1oeq3  5624  f1eq123d  5626  tposf12  6530  brdom2g  7021  brdomg  7022  usgrstrrepeen  16386
  Copyright terms: Public domain W3C validator