Theorem f1orn 6832

Description: A one-to-one function maps onto its range. (Contributed by NM, 13-Aug-2004.)

Assertion

Ref	Expression
f1orn	⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹))

Proof of Theorem f1orn

Step	Hyp	Ref	Expression
1		dff1o2 6827	. 2 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = ran 𝐹))
2		eqid 2762	. . 3 ⊢ ran 𝐹 = ran 𝐹
3		df-3an 1105	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = ran 𝐹) ↔ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹) ∧ ran 𝐹 = ran 𝐹))
4	2, 3	mpbiran2 723	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = ran 𝐹) ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹))
5	1, 4	bitri 278	1 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ^◡ccnv 5658  ran crn 5660  Fun wfun 6531   Fn wfn 6532  –1-1-onto→wf1o 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ex 1813  df-cleq 2754  df-ss 3919  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544

This theorem is used by:  f1f1orn  6833  infdifsn  9640  efopnlem2  26902  cycpmcl  33564