Theorem f1ocnvb 6787

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 6786	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
2		f1ocnv 6786	. . 3 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡◡𝐹:𝐴–1-1-onto→𝐵)
3		dfrel2 6147	. . . 4 ⊢ (Rel 𝐹 ↔ ◡◡𝐹 = 𝐹)
4		f1oeq1 6762	. . . 4 ⊢ (◡◡𝐹 = 𝐹 → (◡◡𝐹:𝐴–1-1-onto→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))
5	3, 4	sylbi 217	. . 3 ⊢ (Rel 𝐹 → (◡◡𝐹:𝐴–1-1-onto→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))
6	2, 5	imbitrid 244	. 2 ⊢ (Rel 𝐹 → (◡𝐹:𝐵–1-1-onto→𝐴 → 𝐹:𝐴–1-1-onto→𝐵))
7	1, 6	impbid2 226	1 ⊢ (Rel 𝐹 → (𝐹:𝐴–1-1-onto→𝐵 ↔ ◡𝐹:𝐵–1-1-onto→𝐴))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1541  ^◡ccnv 5623  Rel wrel 5629  –1-1-onto→wf1o 6491

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499

This theorem is referenced by:  hasheqf1oi  14274