Theorem dff1o2 5576

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 5324	. 2 |- ( F : A -1-1-onto-> B <-> ( F : A -1-1-> B /\ F : A -onto-> B ) )
2		df-f1 5322	. . . 4 |- ( F : A -1-1-> B <-> ( F : A --> B /\ Fun `' F ) )
3		df-fo 5323	. . . 4 |- ( F : A -onto-> B <-> ( F Fn A /\ ran F = B ) )
4	2, 3	anbi12i 460	. . 3 |- ( ( F : A -1-1-> B /\ F : A -onto-> B ) <-> ( ( F : A --> B /\ Fun `' F ) /\ ( F Fn A /\ ran F = B ) ) )
5		anass 401	. . . 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 1014	. . . . . 6 |- ( ( F Fn A /\ Fun `' F /\ ran F = B ) <-> ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) )
7	6	anbi1i 458	. . . . 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 3278	. . . . . . . 8 |- ( ran F = B -> ran F C_ B )
9		df-f 5321	. . . . . . . . 9 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
10	9	biimpri 133	. . . . . . . 8 |- ( ( F Fn A /\ ran F C_ B ) -> F : A --> B )
11	8, 10	sylan2 286	. . . . . . 7 |- ( ( F Fn A /\ ran F = B ) -> F : A --> B )
12	11	3adant2 1040	. . . . . 6 |- ( ( F Fn A /\ Fun `' F /\ ran F = B ) -> F : A --> B )
13	12	pm4.71i 391	. . . . 5 |- ( ( F Fn A /\ Fun `' F /\ ran F = B ) <-> ( ( F Fn A /\ Fun `' F /\ ran F = B ) /\ F : A --> B ) )
14		ancom 266	. . . . 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 213	. . . 4 |- ( ( F : A --> B /\ ( Fun `' F /\ ( F Fn A /\ ran F = B ) ) ) <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )
16	5, 15	bitri 184	. . 3 |- ( ( ( F : A --> B /\ Fun `' F ) /\ ( F Fn A /\ ran F = B ) ) <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )
17	4, 16	bitri 184	. 2 |- ( ( F : A -1-1-> B /\ F : A -onto-> B ) <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )
18	1, 17	bitri 184	1 |- ( F : A -1-1-onto-> B <-> ( F Fn A /\ Fun `' F /\ ran F = B ) )

Syntax hints:   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   C_ wss 3197   `'ccnv 4717   ran crn 4719   Fun wfun 5311   Fn wfn 5312   -->wf 5313   -1-1->wf1 5314   -onto->wfo 5315   -1-1-onto->wf1o 5316

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-11 1552  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-in 3203  df-ss 3210  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324

This theorem is referenced by:  dff1o3  5577  dff1o4  5579  f1orn  5581  en2  6971  dif1en  7037  fiintim  7089