| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1ocnvfvrneq | Structured version Visualization version GIF version | ||
| Description: If the values of a one-to-one function for two arguments from the range of the function are equal, the arguments themselves must be equal. (Contributed by Alexander van der Vekens, 12-Nov-2017.) |
| Ref | Expression |
|---|---|
| f1ocnvfvrneq | ⊢ ((𝐹:𝐴⟶1-1𝐵 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1f1orn 6865 | . . 3 ⊢ (𝐹:𝐴⟶1-1𝐵 → 𝐹:𝐴⟶1-1ontoran 𝐹) | |
| 2 | f1ocnv 6866 | . . 3 ⊢ (𝐹:𝐴⟶1-1ontoran 𝐹 → ◡𝐹:ran 𝐹⟶1-1onto𝐴) | |
| 3 | f1of1 6852 | . . 3 ⊢ (◡𝐹:ran 𝐹⟶1-1onto𝐴 → ◡𝐹:ran 𝐹⟶1-1𝐴) | |
| 4 | f1veqaeq 7290 | . . . 4 ⊢ ((◡𝐹:ran 𝐹⟶1-1𝐴 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)) | |
| 5 | 4 | ex 418 | . . 3 ⊢ (◡𝐹:ran 𝐹⟶1-1𝐴 → ((𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 6 | 1, 2, 3, 5 | 4syl 20 | . 2 ⊢ (𝐹:𝐴⟶1-1𝐵 → ((𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 7 | 6 | imp 412 | 1 ⊢ ((𝐹:𝐴⟶1-1𝐵 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ◡ccnv 5656 ran crn 5658 ⟶1-1wf1 6562 ⟶1-1ontowf1o 6564 ‘cfv 6565 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 |
| This theorem is used by: upgrimtrlslem2 49336 |
| Copyright terms: Public domain | W3C validator |