| 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 6785 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹) | |
| 2 | f1ocnv 6786 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 → ◡𝐹:ran 𝐹–1-1-onto→𝐴) | |
| 3 | f1of1 6773 | . . 3 ⊢ (◡𝐹:ran 𝐹–1-1-onto→𝐴 → ◡𝐹:ran 𝐹–1-1→𝐴) | |
| 4 | f1veqaeq 7202 | . . . 4 ⊢ ((◡𝐹:ran 𝐹–1-1→𝐴 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)) | |
| 5 | 4 | ex 412 | . . 3 ⊢ (◡𝐹:ran 𝐹–1-1→𝐴 → ((𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 6 | 1, 2, 3, 5 | 4syl 19 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → ((𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 7 | 6 | imp 406 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ◡ccnv 5623 ran crn 5625 –1-1→wf1 6489 –1-1-onto→wf1o 6491 ‘cfv 6492 |
| 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-10 2146 ax-11 2162 ax-12 2184 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-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 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-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 |
| This theorem is referenced by: upgrimtrlslem2 48151 |
| Copyright terms: Public domain | W3C validator |