HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem funfn 2689
Description: An equivalence for the function predicate.
Assertion
Ref Expression
funfn |- (Fun A <-> A Fn dom A)

Proof of Theorem funfn
StepHypRef Expression
1 cleqid 1102 . . 3 |- dom A = dom A
21biantru 543 . 2 |- (Fun A <-> (Fun A /\ dom A = dom A))
3 df-fn 2433 . 2 |- (A Fn dom A <-> (Fun A /\ dom A = dom A))
42, 3bitr4 154 1 |- (Fun A <-> A Fn dom A)
Colors of variables: wff set class
Syntax hints:   <-> wb 127   /\ wa 196   = wceq 1091  dom cdm 2410  Fun wfun 2416   Fn wfn 2417
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-gen 677  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-cleq 1097  df-fn 2433
metamath.org