Theorem f1ocnvb 6843

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

Assertion

Ref	Expression
f1ocnvb	⊢ (Rel 𝐹 → (𝐹:𝐴–1-1-onto→𝐵 ↔ ◡𝐹:𝐵–1-1-onto→𝐴))

Proof of Theorem f1ocnvb

Step	Hyp	Ref	Expression
1		f1ocnv 6842	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
2		f1ocnv 6842	. . 3 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡◡𝐹:𝐴–1-1-onto→𝐵)
3		dfrel2 6183	. . . 4 ⊢ (Rel 𝐹 ↔ ◡◡𝐹 = 𝐹)
4		f1oeq1 6817	. . . 4 ⊢ (◡◡𝐹 = 𝐹 → (◡◡𝐹:𝐴–1-1-onto→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))
5	3, 4	sylbi 220	. . 3 ⊢ (Rel 𝐹 → (◡◡𝐹:𝐴–1-1-onto→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))
6	2, 5	imbitrid 247	. 2 ⊢ (Rel 𝐹 → (◡𝐹:𝐵–1-1-onto→𝐴 → 𝐹:𝐴–1-1-onto→𝐵))
7	1, 6	impbid2 229	1 ⊢ (Rel 𝐹 → (𝐹:𝐴–1-1-onto→𝐵 ↔ ◡𝐹:𝐵–1-1-onto→𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  ^◡ccnv 5650  Rel wrel 5656  –1-1-onto→wf1o 6542

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550

This theorem is used by:  hasheqf1oi  14502