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

Theorem f1eq3 5460
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 5392 . . 3  |-  ( A  =  B  ->  ( F : C --> A  <->  F : C
--> B ) )
21anbi1d 465 . 2  |-  ( A  =  B  ->  (
( F : C --> A  /\  Fun  `' F
)  <->  ( F : C
--> B  /\  Fun  `' F ) ) )
3 df-f1 5263 . 2  |-  ( F : C -1-1-> A  <->  ( F : C --> A  /\  Fun  `' F ) )
4 df-f1 5263 . 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 1364   `'ccnv 4662   Fun wfun 5252   -->wf 5254   -1-1->wf1 5255
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-11 1520  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-in 3163  df-ss 3170  df-f 5262  df-f1 5263
This theorem is referenced by:  f1oeq3  5494  f1eq123d  5496  tposf12  6327  brdomg  6807
  Copyright terms: Public domain W3C validator