Theorem f1resveqaeq 35482

Description: If a function restricted to a class is one-to-one, then for any two elements of the class, the values of the function at those elements are equal only if the two elements are the same element. (Contributed by BTernaryTau, 27-Sep-2023.)

Assertion

Ref	Expression
f1resveqaeq	⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))

Proof of Theorem f1resveqaeq

Step	Hyp	Ref	Expression
1		fvres 6900	. . . 4 ⊢ (𝐶 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝐶) = (𝐹‘𝐶))
2	1	ad2antrl 740	. . 3 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝐶) = (𝐹‘𝐶))
3		fvres 6900	. . . 4 ⊢ (𝐷 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝐷) = (𝐹‘𝐷))
4	3	ad2antll 741	. . 3 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝐷) = (𝐹‘𝐷))
5	2, 4	eqeq12d 2778	. 2 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝐶) = ((𝐹 ↾ 𝐴)‘𝐷) ↔ (𝐹‘𝐶) = (𝐹‘𝐷)))
6		f1veqaeq 7254	. 2 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝐶) = ((𝐹 ↾ 𝐴)‘𝐷) → 𝐶 = 𝐷))
7	5, 6	sylbird 263	1 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142   ↾ cres 5662  –1-1→wf1 6533  ‘cfv 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-res 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fv 6544

This theorem is used by:  f1resrcmplf1d  35484