Theorem f1ocnvb 6150

Description: A relation is a one-to-one onto function iff its converse is a one-to-one onto function with domain and range interchanged. (Contributed by NM, 8-Dec-2003.)

Assertion

Ref	Expression
f1ocnvb	|- ( Rel F -> ( F : A -1-1-onto-> B <-> `' F : B -1-1-onto-> A ) )

Proof of Theorem f1ocnvb

Step	Hyp	Ref	Expression
1		f1ocnv 6149	. 2 |- ( F : A -1-1-onto-> B -> `' F : B -1-1-onto-> A )
2		f1ocnv 6149	. . 3 |- ( `' F : B -1-1-onto-> A -> `' `' F : A -1-1-onto-> B )
3		dfrel2 5583	. . . 4 |- ( Rel F <-> `' `' F = F )
4		f1oeq1 6127	. . . 4 |- ( `' `' F = F -> ( `' `' F : A -1-1-onto-> B <-> F : A -1-1-onto-> B ) )
5	3, 4	sylbi 207	. . 3 |- ( Rel F -> ( `' `' F : A -1-1-onto-> B <-> F : A -1-1-onto-> B ) )
6	2, 5	syl5ib 234	. 2 |- ( Rel F -> ( `' F : B -1-1-onto-> A -> F : A -1-1-onto-> B ) )
7	1, 6	impbid2 216	1 |- ( Rel F -> ( F : A -1-1-onto-> B <-> `' F : B -1-1-onto-> A ) )

Syntax hints:   -> wi 4   <-> wb 196   = wceq 1483   `'ccnv 5113   Rel wrel 5119   -1-1-onto->wf1o 5887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895

This theorem is referenced by:  hasheqf1oi  13140  hasheqf1oiOLD  13141