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

Theorem ffund 5351
Description: A mapping is a function, deduction version. (Contributed by Glauco Siliprandi, 3-Mar-2021.)
Hypothesis
Ref Expression
ffund.1  |-  ( ph  ->  F : A --> B )
Assertion
Ref Expression
ffund  |-  ( ph  ->  Fun  F )

Proof of Theorem ffund
StepHypRef Expression
1 ffund.1 . 2  |-  ( ph  ->  F : A --> B )
2 ffun 5350 . 2  |-  ( F : A --> B  ->  Fun  F )
31, 2syl 14 1  |-  ( ph  ->  Fun  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4   Fun wfun 5192   -->wf 5194
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105
This theorem depends on definitions:  df-bi 116  df-fn 5201  df-f 5202
This theorem is referenced by:  ennnfonelemrnh  12371  ennnfonelemf1  12373  ctinfomlemom  12382  cncnp  13024  txcnp  13065  dvidlemap  13454  dvaddxx  13461  dvmulxx  13462  dvcjbr  13466  dvcj  13467  dvrecap  13471
  Copyright terms: Public domain W3C validator