Theorem dff1o2 5131

Description: Alternate definition of one-to-one onto function. (Contributed by NM, 10-Feb-1997.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)

Assertion

Ref	Expression
dff1o2	|- ( F : A -1-1-onto-> B <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )

Proof of Theorem dff1o2

Step	Hyp	Ref	Expression
1		df-f1o 4909	. 2 |- ( F : A -1-1-onto-> B <-> ( F : A -1-1-> B /\ F : A -onto-> B ) )
2		df-f1 4907	. . . 4 |- ( F : A -1-1-> B <-> ( F : A --> B /\ Fun `' F ) )
3		df-fo 4908	. . . 4 |- ( F : A -onto-> B <-> ( F Fn A /\ ran F = B ) )
4	2, 3	anbi12i 433	. . 3 |- ( ( F : A -1-1-> B /\ F : A -onto-> B ) <-> ( ( F : A --> B /\ Fun `' F ) /\ ( F Fn A /\ ran F = B ) ) )
5		anass 381	. . . 4 |- ( ( ( F : A --> B /\ Fun `' F ) /\ ( F Fn A /\ ran F = B ) ) <-> ( F : A --> B /\ ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) ) )
6		3anan12 897	. . . . . 6 |- ( ( F Fn A /\ Fun `' F /\ ran F = B ) <-> ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) )
7	6	anbi1i 431	. . . . 5 |- ( ( ( F Fn A /\ Fun `' F /\ ran F = B ) /\ F : A --> B ) <-> ( ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) /\ F : A --> B ) )
8		eqimss 2997	. . . . . . . 8 |- ( ran F = B -> ran F C_ B )
9		df-f 4906	. . . . . . . . 9 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
10	9	biimpri 124	. . . . . . . 8 |- ( ( F Fn A /\ ran F C_ B ) -> F : A --> B )
11	8, 10	sylan2 270	. . . . . . 7 |- ( ( F Fn A /\ ran F = B ) -> F : A --> B )
12	11	3adant2 923	. . . . . 6 |- ( ( F Fn A /\ Fun `' F /\ ran F = B ) -> F : A --> B )
13	12	pm4.71i 371	. . . . 5 |- ( ( F Fn A /\ Fun `' F /\ ran F = B ) <-> ( ( F Fn A /\ Fun `' F /\ ran F = B ) /\ F : A --> B ) )
14		ancom 253	. . . . 5 |- ( ( F : A --> B /\ ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) ) <-> ( ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) /\ F : A --> B ) )
15	7, 13, 14	3bitr4ri 202	. . . 4 |- ( ( F : A --> B /\ ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) ) <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )
16	5, 15	bitri 173	. . 3 |- ( ( ( F : A --> B /\ Fun `' F ) /\ ( F Fn A /\ ran F = B ) ) <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )
17	4, 16	bitri 173	. 2 |- ( ( F : A -1-1-> B /\ F : A -onto-> B ) <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )
18	1, 17	bitri 173	1 |- ( F : A -1-1-onto-> B <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )

Syntax hints:   /\ wa 97   <-> wb 98   /\ w3a 885   = wceq 1243   C_ wss 2917   `'ccnv 4344   ran crn 4346   Fun wfun 4896   Fn wfn 4897   -->wf 4898   -1-1->wf1 4899   -onto->wfo 4900   -1-1-onto->wf1o 4901

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-11 1397  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-3an 887  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-in 2924  df-ss 2931  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909

This theorem is referenced by:  dff1o3  5132  dff1o4  5134  f1orn  5136  dif1en  6337