| 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 5837 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑐 ∈ 𝐴 ∀𝑑 ∈ 𝐴 ((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑))) | |
| 2 | fveq2 5576 | . . . . . . . 8 ⊢ (𝑐 = 𝐶 → (𝐹‘𝑐) = (𝐹‘𝐶)) | |
| 3 | 2 | eqeq1d 2214 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → ((𝐹‘𝑐) = (𝐹‘𝑑) ↔ (𝐹‘𝐶) = (𝐹‘𝑑))) |
| 4 | eqeq1 2212 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → (𝑐 = 𝑑 ↔ 𝐶 = 𝑑)) | |
| 5 | 3, 4 | imbi12d 234 | . . . . . 6 ⊢ (𝑐 = 𝐶 → (((𝐹‘𝑐) = (𝐹‘𝑑) → 𝑐 = 𝑑) ↔ ((𝐹‘𝐶) = (𝐹‘𝑑) → 𝐶 = 𝑑))) |
| 6 | fveq2 5576 | . . . . . . . 8 ⊢ (𝑑 = 𝐷 → (𝐹‘𝑑) = (𝐹‘𝐷)) | |
| 7 | 6 | eqeq2d 2217 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → ((𝐹‘𝐶) = (𝐹‘𝑑) ↔ (𝐹‘𝐶) = (𝐹‘𝐷))) |
| 8 | eqeq2 2215 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → (𝐶 = 𝑑 ↔ 𝐶 = 𝐷)) | |
| 9 | 7, 8 | imbi12d 234 | . . . . . 6 ⊢ (𝑑 = 𝐷 → (((𝐹‘𝐶) = (𝐹‘𝑑) → 𝐶 = 𝑑) ↔ ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))) |
| 10 | 5, 9 | rspc2v 2890 | . . . . 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 1373 ∈ wcel 2176 ∀wral 2484 ⟶wf 5267 –1-1→wf1 5268 ‘cfv 5271 |
| 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 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-pow 4218 ax-pr 4253 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ral 2489 df-rex 2490 df-v 2774 df-sbc 2999 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-br 4045 df-opab 4106 df-id 4340 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-f1 5276 df-fv 5279 |
| This theorem is referenced by: f1fveq 5841 f1ocnvfvrneq 5851 f1o2ndf1 6314 fidceq 6966 difinfsnlem 7201 difinfsn 7202 iseqf1olemab 10647 iseqf1olemnanb 10648 f1ghm0to0 13608 1dom1el 15927 pwle2 15935 |
| Copyright terms: Public domain | W3C validator |