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

Theorem feq2i 5397
Description: Equality inference for functions. (Contributed by NM, 5-Sep-2011.)
Hypothesis
Ref Expression
feq2i.1  |-  A  =  B
Assertion
Ref Expression
feq2i  |-  ( F : A --> C  <->  F : B
--> C )

Proof of Theorem feq2i
StepHypRef Expression
1 feq2i.1 . 2  |-  A  =  B
2 feq2 5387 . 2  |-  ( A  =  B  ->  ( F : A --> C  <->  F : B
--> C ) )
31, 2ax-mp 5 1  |-  ( F : A --> C  <->  F : B
--> C )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1364   -->wf 5250
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 1458  ax-gen 1460  ax-4 1521  ax-17 1537  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-cleq 2186  df-fn 5257  df-f 5258
This theorem is referenced by:  fmpox  6253  fmpo  6254  tposf  6325  issmo  6341  tfrcllemsucfn  6406  1fv  10205  fxnn0nninf  10510  snopiswrd  10924  iswrddm0  10938  0met  14552  dvef  14873
  Copyright terms: Public domain W3C validator