Theorem f1funOLD 6767

Description: Obsolete version of f1fun 6766 as of 10-Jun-2026. (Contributed by NM, 8-Mar-2014.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
f1funOLD	⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹)

Proof of Theorem f1funOLD

Step	Hyp	Ref	Expression
1		f1fn 6765	. 2 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴)
2		fnfun 6625	. 2 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3	1, 2	syl 18	1 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹)

Syntax hints:   → wi 4  Fun wfun 6519   Fn wfn 6520  –1-1→wf1 6522

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 210  df-an 401  df-fn 6528  df-f 6529  df-f1 6530

This theorem is referenced by: (None)