Theorem f1ocnvfvrneq 7304

Description: If the values of a one-to-one function for two arguments from the range of the function are equal, the arguments themselves must be equal. (Contributed by Alexander van der Vekens, 12-Nov-2017.)

Assertion

Ref	Expression
f1ocnvfvrneq	⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))

Proof of Theorem f1ocnvfvrneq

Step	Hyp	Ref	Expression
1		f1f1orn 6847	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹)
2		f1ocnv 6848	. . 3 ⊢ (𝐹:𝐴–1-1-onto→ran 𝐹 → ◡𝐹:ran 𝐹–1-1-onto→𝐴)
3		f1of1 6834	. . 3 ⊢ (◡𝐹:ran 𝐹–1-1-onto→𝐴 → ◡𝐹:ran 𝐹–1-1→𝐴)
4		f1veqaeq 7270	. . . 4 ⊢ ((◡𝐹:ran 𝐹–1-1→𝐴 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))
5	4	ex 418	. . 3 ⊢ (◡𝐹:ran 𝐹–1-1→𝐴 → ((𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)))
6	1, 2, 3, 5	4syl 20	. 2 ⊢ (𝐹:𝐴–1-1→𝐵 → ((𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷)))
7	6	imp 412	1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝐶 ∈ ran 𝐹 ∧ 𝐷 ∈ ran 𝐹)) → ((◡𝐹‘𝐶) = (◡𝐹‘𝐷) → 𝐶 = 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ^◡ccnv 5654  ran crn 5656  –1-1→wf1 6544  –1-1-onto→wf1o 6546  ‘cfv 6547

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555

This theorem is used by:  upgrimtrlslem2  49148