| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1veqaeq | 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 5919 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑))) | |
| 2 | fveq2 5648 | . . . . . . . 8 ⊢ (𝑐 = 𝐶 → (𝐹‘𝑐) = (𝐹‘𝐶)) | |
| 3 | 2 | eqeq1d 2240 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → ((𝐹‘𝑐) = (𝐹‘𝑑) ↔ (𝐹‘𝐶) = (𝐹‘𝑑))) |
| 4 | eqeq1 2238 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → (𝑐 = 𝑑 ↔ 𝐶 = 𝑑)) | |
| 5 | 3, 4 | imbi12d 234 | . . . . . 6 ⊢ (𝑐 = 𝐶 → (((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) ↔ ((𝐹‘𝐶) = (𝐹‘𝑑) → 𝐶 = 𝑑))) |
| 6 | fveq2 5648 | . . . . . . . 8 ⊢ (𝑑 = 𝐷 → (𝐹‘𝑑) = (𝐹‘𝐷)) | |
| 7 | 6 | eqeq2d 2243 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → ((𝐹‘𝐶) = (𝐹‘𝑑) ↔ (𝐹‘𝐶) = (𝐹‘𝐷))) |
| 8 | eqeq2 2241 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → (𝐶 = 𝑑 ↔ 𝐶 = 𝐷)) | |
| 9 | 7, 8 | imbi12d 234 | . . . . . 6 ⊢ (𝑑 = 𝐷 → (((𝐹‘𝐶) = (𝐹‘𝑑) → 𝐶 = 𝑑) ↔ ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 10 | 5, 9 | rspc2v 2924 | . . . . 5 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 11 | 10 | com12 30 | . . . 4 ⊢ (∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 12 | 11 | adantl 277 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑)) → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 13 | 1, 12 | sylbi 121 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 14 | 13 | imp 124 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ∀wral 2511 ⟶wf 5329 –1-1→wf1 5330 ‘cfv 5333 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-sbc 3033 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fv 5341 |
| This theorem is referenced by: f1fveq 5923 f1ocnvfvrneq 5933 f1o2ndf1 6402 1dom1el 7036 fidceq 7099 difinfsnlem 7358 difinfsn 7359 pr2cv1 7460 iseqf1olemab 10827 iseqf1olemnanb 10828 f1ghm0to0 13939 uspgr2wlkeq 16306 3dom 16708 pwle2 16720 |
| Copyright terms: Public domain | W3C validator |