Theorem f1orescnv 5608

Description: The converse of a one-to-one-onto restricted function. (Contributed by Paul Chapman, 21-Apr-2008.)

Assertion

Ref	Expression
f1orescnv	|- ( ( Fun `' F /\ ( F |` R ) : R -1-1-onto-> P ) -> ( `' F |` P ) : P -1-1-onto-> R )

Proof of Theorem f1orescnv

Step	Hyp	Ref	Expression
1		f1ocnv 5605	. . 3 |- ( ( F |` R ) : R -1-1-onto-> P -> `' ( F |` R ) : P -1-1-onto-> R )
2	1	adantl 277	. 2 |- ( ( Fun `' F /\ ( F |` R ) : R -1-1-onto-> P ) -> `' ( F |` R ) : P -1-1-onto-> R )
3		funcnvres 5410	. . . 4 |- ( Fun `' F -> `' ( F |` R ) = ( `' F |` ( F " R ) ) )
4		df-ima 4744	. . . . . 6 |- ( F " R ) = ran ( F |` R )
5		dff1o5 5601	. . . . . . 7 |- ( ( F |` R ) : R -1-1-onto-> P <-> ( ( F |` R ) : R -1-1-> P /\ ran ( F |` R ) = P ) )
6	5	simprbi 275	. . . . . 6 |- ( ( F |` R ) : R -1-1-onto-> P -> ran ( F |` R ) = P )
7	4, 6	eqtrid 2276	. . . . 5 |- ( ( F |` R ) : R -1-1-onto-> P -> ( F " R ) = P )
8	7	reseq2d 5019	. . . 4 |- ( ( F |` R ) : R -1-1-onto-> P -> ( `' F |` ( F " R ) ) = ( `' F |` P ) )
9	3, 8	sylan9eq 2284	. . 3 |- ( ( Fun `' F /\ ( F |` R ) : R -1-1-onto-> P ) -> `' ( F |` R ) = ( `' F |` P ) )
10		f1oeq1 5580	. . 3 |- ( `' ( F |` R ) = ( `' F |` P ) -> ( `' ( F |` R ) : P -1-1-onto-> R <-> ( `' F |` P ) : P -1-1-onto-> R ) )
11	9, 10	syl 14	. 2 |- ( ( Fun `' F /\ ( F |` R ) : R -1-1-onto-> P ) -> ( `' ( F |` R ) : P -1-1-onto-> R <-> ( `' F |` P ) : P -1-1-onto-> R ) )
12	2, 11	mpbid 147	1 |- ( ( Fun `' F /\ ( F |` R ) : R -1-1-onto-> P ) -> ( `' F |` P ) : P -1-1-onto-> R )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   `'ccnv 4730   ran crn 4732   |` cres 4733   "cima 4734   Fun wfun 5327   -1-1->wf1 5330   -1-1-onto->wf1o 5332

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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340

This theorem is referenced by:  f1oresrab  5820