Theorem f1resveqaeq 7273

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 6901	. . . 4 ⊢ (𝐶 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝐶) = (𝐹‘𝐶))
2	1	ad2antrl 741	. . 3 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝐶) = (𝐹‘𝐶))
3		fvres 6901	. . . 4 ⊢ (𝐷 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝐷) = (𝐹‘𝐷))
4	3	ad2antll 742	. . 3 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝐷) = (𝐹‘𝐷))
5	2, 4	eqeq12d 2778	. 2 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝐶) = ((𝐹 ↾ 𝐴)‘𝐷) ↔ (𝐹‘𝐶) = (𝐹‘𝐷)))
6		f1veqaeq 7256	. 2 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝐶) = ((𝐹 ↾ 𝐴)‘𝐷) → 𝐶 = 𝐷))
7	5, 6	sylbird 263	1 ⊢ (((𝐹 ↾ 𝐴):𝐴–1-1→𝐵 ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐹‘𝐶) = (𝐹‘𝐷) → 𝐶 = 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↾ cres 5661  –1-1→wf1 6534  ‘cfv 6537

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-res 5671  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fv 6545

This theorem is used by:  f1resrcmplf1d  7275