ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1veqaeq GIF version

Theorem f1veqaeq 5737
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.)
Assertion
Ref Expression
f1veqaeq ((𝐹:𝐴1-1𝐵 ∧ (𝐶𝐴𝐷𝐴)) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷))

Proof of Theorem f1veqaeq
Dummy variables 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dff13 5736 . . 3 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑)))
2 fveq2 5486 . . . . . . . 8 (𝑐 = 𝐶 → (𝐹𝑐) = (𝐹𝐶))
32eqeq1d 2174 . . . . . . 7 (𝑐 = 𝐶 → ((𝐹𝑐) = (𝐹𝑑) ↔ (𝐹𝐶) = (𝐹𝑑)))
4 eqeq1 2172 . . . . . . 7 (𝑐 = 𝐶 → (𝑐 = 𝑑𝐶 = 𝑑))
53, 4imbi12d 233 . . . . . 6 (𝑐 = 𝐶 → (((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑) ↔ ((𝐹𝐶) = (𝐹𝑑) → 𝐶 = 𝑑)))
6 fveq2 5486 . . . . . . . 8 (𝑑 = 𝐷 → (𝐹𝑑) = (𝐹𝐷))
76eqeq2d 2177 . . . . . . 7 (𝑑 = 𝐷 → ((𝐹𝐶) = (𝐹𝑑) ↔ (𝐹𝐶) = (𝐹𝐷)))
8 eqeq2 2175 . . . . . . 7 (𝑑 = 𝐷 → (𝐶 = 𝑑𝐶 = 𝐷))
97, 8imbi12d 233 . . . . . 6 (𝑑 = 𝐷 → (((𝐹𝐶) = (𝐹𝑑) → 𝐶 = 𝑑) ↔ ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
105, 9rspc2v 2843 . . . . 5 ((𝐶𝐴𝐷𝐴) → (∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
1110com12 30 . . . 4 (∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑) → ((𝐶𝐴𝐷𝐴) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
1211adantl 275 . . 3 ((𝐹:𝐴𝐵 ∧ ∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑)) → ((𝐶𝐴𝐷𝐴) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
131, 12sylbi 120 . 2 (𝐹:𝐴1-1𝐵 → ((𝐶𝐴𝐷𝐴) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
1413imp 123 1 ((𝐹:𝐴1-1𝐵 ∧ (𝐶𝐴𝐷𝐴)) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1343  wcel 2136  wral 2444  wf 5184  1-1wf1 5185  cfv 5188
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fv 5196
This theorem is referenced by:  f1fveq  5740  f1ocnvfvrneq  5750  f1o2ndf1  6196  fidceq  6835  difinfsnlem  7064  difinfsn  7065  iseqf1olemab  10424  iseqf1olemnanb  10425  pwle2  13888
  Copyright terms: Public domain W3C validator