Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > f1cnv | Structured version Visualization version GIF version |
Description: The converse of an injective function is bijective. (Contributed by FL, 11-Nov-2011.) |
Ref | Expression |
---|---|
f1cnv | ⊢ (𝐹:𝐴–1-1→𝐵 → ◡𝐹:ran 𝐹–1-1-onto→𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1f1orn 6628 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹) | |
2 | f1ocnv 6629 | . 2 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 → ◡𝐹:ran 𝐹–1-1-onto→𝐴) | |
3 | 1, 2 | syl 17 | 1 ⊢ (𝐹:𝐴–1-1→𝐵 → ◡𝐹:ran 𝐹–1-1-onto→𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ◡ccnv 5556 ran crn 5558 –1-1→wf1 6354 –1-1-onto→wf1o 6356 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 |
This theorem is referenced by: f1dmex 7660 fin1a2lem7 9830 cycpmco2f1 30768 cycpmco2rn 30769 cycpmco2lem2 30771 cycpmco2lem3 30772 cycpmco2lem4 30773 cycpmco2lem5 30774 cycpmco2lem6 30775 cycpmco2lem7 30776 cycpmco2 30777 diophrw 39363 |
Copyright terms: Public domain | W3C validator |