Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > f1oexbi | Structured version Visualization version GIF version |
Description: There is a one-to-one onto function from a set to a second set iff there is a one-to-one onto function from the second set to the first set. (Contributed by Alexander van der Vekens, 30-Sep-2018.) |
Ref | Expression |
---|---|
f1oexbi | ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→𝐵 ↔ ∃𝑔 𝑔:𝐵–1-1-onto→𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3499 | . . . . 5 ⊢ 𝑓 ∈ V | |
2 | 1 | cnvex 7632 | . . . 4 ⊢ ◡𝑓 ∈ V |
3 | f1ocnv 6629 | . . . 4 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → ◡𝑓:𝐵–1-1-onto→𝐴) | |
4 | f1oeq1 6606 | . . . . 5 ⊢ (𝑔 = ◡𝑓 → (𝑔:𝐵–1-1-onto→𝐴 ↔ ◡𝑓:𝐵–1-1-onto→𝐴)) | |
5 | 4 | spcegv 3599 | . . . 4 ⊢ (◡𝑓 ∈ V → (◡𝑓:𝐵–1-1-onto→𝐴 → ∃𝑔 𝑔:𝐵–1-1-onto→𝐴)) |
6 | 2, 3, 5 | mpsyl 68 | . . 3 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → ∃𝑔 𝑔:𝐵–1-1-onto→𝐴) |
7 | 6 | exlimiv 1931 | . 2 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→𝐵 → ∃𝑔 𝑔:𝐵–1-1-onto→𝐴) |
8 | vex 3499 | . . . . 5 ⊢ 𝑔 ∈ V | |
9 | 8 | cnvex 7632 | . . . 4 ⊢ ◡𝑔 ∈ V |
10 | f1ocnv 6629 | . . . 4 ⊢ (𝑔:𝐵–1-1-onto→𝐴 → ◡𝑔:𝐴–1-1-onto→𝐵) | |
11 | f1oeq1 6606 | . . . . 5 ⊢ (𝑓 = ◡𝑔 → (𝑓:𝐴–1-1-onto→𝐵 ↔ ◡𝑔:𝐴–1-1-onto→𝐵)) | |
12 | 11 | spcegv 3599 | . . . 4 ⊢ (◡𝑔 ∈ V → (◡𝑔:𝐴–1-1-onto→𝐵 → ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)) |
13 | 9, 10, 12 | mpsyl 68 | . . 3 ⊢ (𝑔:𝐵–1-1-onto→𝐴 → ∃𝑓 𝑓:𝐴–1-1-onto→𝐵) |
14 | 13 | exlimiv 1931 | . 2 ⊢ (∃𝑔 𝑔:𝐵–1-1-onto→𝐴 → ∃𝑓 𝑓:𝐴–1-1-onto→𝐵) |
15 | 7, 14 | impbii 211 | 1 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→𝐵 ↔ ∃𝑔 𝑔:𝐵–1-1-onto→𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∃wex 1780 ∈ wcel 2114 Vcvv 3496 ◡ccnv 5556 –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-pow 5268 ax-pr 5332 ax-un 7463 |
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-ral 3145 df-rex 3146 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-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 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: rusgrnumwlkg 27758 f1ocnt 30527 |
Copyright terms: Public domain | W3C validator |