| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1veqaeq | Structured version Visualization version GIF version | ||
| Description: If the values of a one-to-one function for two arguments are equal, the arguments themselves must be equal. (Contributed by Alexander van der Vekens, 12-Nov-2017.) |
| Ref | Expression |
|---|---|
| f1veqaeq | ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dff13 7204 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑))) | |
| 2 | fveqeq2 6845 | . . . . . 6 ⊢ (𝑐 = 𝐶 → ((𝐹‘𝑐) = (𝐹‘𝑑) ↔ (𝐹‘𝐶) = (𝐹‘𝑑))) | |
| 3 | eqeq1 2741 | . . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑐 = 𝑑 ↔ 𝐶 = 𝑑)) | |
| 4 | 2, 3 | imbi12d 344 | . . . . 5 ⊢ (𝑐 = 𝐶 → (((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) ↔ ((𝐹‘𝐶) = (𝐹‘𝑑) → 𝐶 = 𝑑))) |
| 5 | fveq2 6836 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → (𝐹‘𝑑) = (𝐹‘𝐷)) | |
| 6 | 5 | eqeq2d 2748 | . . . . . 6 ⊢ (𝑑 = 𝐷 → ((𝐹‘𝐶) = (𝐹‘𝑑) ↔ (𝐹‘𝐶) = (𝐹‘𝐷))) |
| 7 | eqeq2 2749 | . . . . . 6 ⊢ (𝑑 = 𝐷 → (𝐶 = 𝑑 ↔ 𝐶 = 𝐷)) | |
| 8 | 6, 7 | imbi12d 344 | . . . . 5 ⊢ (𝑑 = 𝐷 → (((𝐹‘𝐶) = (𝐹‘𝑑) → 𝐶 = 𝑑) ↔ ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 9 | 4, 8 | rspc2v 3576 | . . . 4 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 10 | 9 | com12 32 | . . 3 ⊢ (∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 11 | 1, 10 | simplbiim 504 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 12 | 11 | imp 406 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ⟶wf 6490 –1-1→wf1 6491 ‘cfv 6494 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5521 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fv 6502 |
| This theorem is referenced by: f1cofveqaeq 7207 f1cofveqaeqALT 7208 dff14i 7209 f1fveq 7212 f1cdmsn 7232 f1prex 7234 f1ocnvfvrneq 7236 fvf1pr 7257 f1o2ndf1 8067 fvf1tp 13743 f1ghm0to0 19215 symgfvne 19351 mat2pmatf1 22708 f1otrg 28957 uspgr2wlkeq 29733 pthdivtx 29814 spthdep 29821 spthonepeq 29839 usgr2trlncl 29847 ccatf1 33028 swrdf1 33035 cycpmrn 33223 f1resveqaeq 35248 vonf1owev 35310 mh-inf3f1 36743 poimirlem1 37960 poimirlem9 37968 poimirlem22 37981 mblfinlem2 37997 ricdrng1 42991 permaxext 45454 isuspgrim0lem 48385 isubgr3stgrlem7 48464 |
| Copyright terms: Public domain | W3C validator |