Theorem f1orn 5649

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 5644	. 2 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = ran 𝐹))
2		eqid 2238	. . 3 ⊢ ran 𝐹 = ran 𝐹
3		df-3an 1011	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = ran 𝐹) ↔ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹) ∧ ran 𝐹 = ran 𝐹))
4	2, 3	mpbiran2 954	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = ran 𝐹) ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹))
5	1, 4	bitri 184	1 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹))

This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402  ^◡ccnv 4773  ran crn 4775  Fun wfun 5371   Fn wfn 5372  –1-1-onto→wf1o 5376

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-in 3226  df-ss 3233  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384

This theorem is used by:  f1f1orn  5650