Theorem ffunOLD 6710

Description: Obsolete version of ffun 6709 as of 10-Jun-2026. (Contributed by NM, 3-Aug-1994.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
ffunOLD	⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)

Proof of Theorem ffunOLD

Step	Hyp	Ref	Expression
1		ffn 6706	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
2		fnfun 6636	. 2 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3	1, 2	syl 18	1 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)

This proof depends on syntax axioms:   → wi 4  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-fn 6540  df-f 6541

This theorem is used by: (None)