![]() |
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 6601 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹) | |
2 | f1ocnv 6602 | . 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 5518 ran crn 5520 –1-1→wf1 6321 –1-1-onto→wf1o 6323 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 |
This theorem is referenced by: f1dmex 7640 fin1a2lem7 9817 cycpmco2f1 30816 cycpmco2rn 30817 cycpmco2lem2 30819 cycpmco2lem3 30820 cycpmco2lem4 30821 cycpmco2lem5 30822 cycpmco2lem6 30823 cycpmco2lem7 30824 cycpmco2 30825 diophrw 39700 |
Copyright terms: Public domain | W3C validator |