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

Theorem f1veqaeq 5965
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 5964 . . 3 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑)))
2 fveq2 5690 . . . . . . . 8 (𝑐 = 𝐶 → (𝐹𝑐) = (𝐹𝐶))
32eqeq1d 2247 . . . . . . 7 (𝑐 = 𝐶 → ((𝐹𝑐) = (𝐹𝑑) ↔ (𝐹𝐶) = (𝐹𝑑)))
4 eqeq1 2245 . . . . . . 7 (𝑐 = 𝐶 → (𝑐 = 𝑑𝐶 = 𝑑))
53, 4imbi12d 234 . . . . . 6 (𝑐 = 𝐶 → (((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑) ↔ ((𝐹𝐶) = (𝐹𝑑) → 𝐶 = 𝑑)))
6 fveq2 5690 . . . . . . . 8 (𝑑 = 𝐷 → (𝐹𝑑) = (𝐹𝐷))
76eqeq2d 2250 . . . . . . 7 (𝑑 = 𝐷 → ((𝐹𝐶) = (𝐹𝑑) ↔ (𝐹𝐶) = (𝐹𝐷)))
8 eqeq2 2248 . . . . . . 7 (𝑑 = 𝐷 → (𝐶 = 𝑑𝐶 = 𝐷))
97, 8imbi12d 234 . . . . . 6 (𝑑 = 𝐷 → (((𝐹𝐶) = (𝐹𝑑) → 𝐶 = 𝑑) ↔ ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
105, 9rspc2v 2943 . . . . 5 ((𝐶𝐴𝐷𝐴) → (∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
1110com12 30 . . . 4 (∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑) → ((𝐶𝐴𝐷𝐴) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
1211adantl 277 . . 3 ((𝐹:𝐴𝐵 ∧ ∀𝑐𝐴𝑑𝐴 ((𝐹𝑐) = (𝐹𝑑) → 𝑐 = 𝑑)) → ((𝐶𝐴𝐷𝐴) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
131, 12sylbi 121 . 2 (𝐹:𝐴1-1𝐵 → ((𝐶𝐴𝐷𝐴) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷)))
1413imp 124 1 ((𝐹:𝐴1-1𝐵 ∧ (𝐶𝐴𝐷𝐴)) → ((𝐹𝐶) = (𝐹𝐷) → 𝐶 = 𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wcel 2209  wral 2528  wf 5368  1-1wf1 5369  cfv 5372
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fv 5380
This theorem is referenced by:  f1fveq  5968  f1ocnvfvrneq  5978  f1o2ndf1  6454  1dom1el  7097  fidceq  7161  difinfsnlem  7429  difinfsn  7430  pr2cv1  7531  iseqf1olemab  10917  iseqf1olemnanb  10918  f1ghm0to0  14052  uspgr2wlkeq  16520  3dom  16932  pwle2  16942
  Copyright terms: Public domain W3C validator