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

Theorem f1veqaeq 5909
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  |-  ( ( F : A -1-1-> B  /\  ( C  e.  A  /\  D  e.  A
) )  ->  (
( F `  C
)  =  ( F `
 D )  ->  C  =  D )
)

Proof of Theorem f1veqaeq
Dummy variables  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dff13 5908 . . 3  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  A. c  e.  A  A. d  e.  A  (
( F `  c
)  =  ( F `
 d )  -> 
c  =  d ) ) )
2 fveq2 5639 . . . . . . . 8  |-  ( c  =  C  ->  ( F `  c )  =  ( F `  C ) )
32eqeq1d 2240 . . . . . . 7  |-  ( c  =  C  ->  (
( F `  c
)  =  ( F `
 d )  <->  ( F `  C )  =  ( F `  d ) ) )
4 eqeq1 2238 . . . . . . 7  |-  ( c  =  C  ->  (
c  =  d  <->  C  =  d ) )
53, 4imbi12d 234 . . . . . 6  |-  ( c  =  C  ->  (
( ( F `  c )  =  ( F `  d )  ->  c  =  d )  <->  ( ( F `
 C )  =  ( F `  d
)  ->  C  =  d ) ) )
6 fveq2 5639 . . . . . . . 8  |-  ( d  =  D  ->  ( F `  d )  =  ( F `  D ) )
76eqeq2d 2243 . . . . . . 7  |-  ( d  =  D  ->  (
( F `  C
)  =  ( F `
 d )  <->  ( F `  C )  =  ( F `  D ) ) )
8 eqeq2 2241 . . . . . . 7  |-  ( d  =  D  ->  ( C  =  d  <->  C  =  D ) )
97, 8imbi12d 234 . . . . . 6  |-  ( d  =  D  ->  (
( ( F `  C )  =  ( F `  d )  ->  C  =  d )  <->  ( ( F `
 C )  =  ( F `  D
)  ->  C  =  D ) ) )
105, 9rspc2v 2923 . . . . 5  |-  ( ( C  e.  A  /\  D  e.  A )  ->  ( A. c  e.  A  A. d  e.  A  ( ( F `
 c )  =  ( F `  d
)  ->  c  =  d )  ->  (
( F `  C
)  =  ( F `
 D )  ->  C  =  D )
) )
1110com12 30 . . . 4  |-  ( A. c  e.  A  A. d  e.  A  (
( F `  c
)  =  ( F `
 d )  -> 
c  =  d )  ->  ( ( C  e.  A  /\  D  e.  A )  ->  (
( F `  C
)  =  ( F `
 D )  ->  C  =  D )
) )
1211adantl 277 . . 3  |-  ( ( F : A --> B  /\  A. c  e.  A  A. d  e.  A  (
( F `  c
)  =  ( F `
 d )  -> 
c  =  d ) )  ->  ( ( C  e.  A  /\  D  e.  A )  ->  ( ( F `  C )  =  ( F `  D )  ->  C  =  D ) ) )
131, 12sylbi 121 . 2  |-  ( F : A -1-1-> B  -> 
( ( C  e.  A  /\  D  e.  A )  ->  (
( F `  C
)  =  ( F `
 D )  ->  C  =  D )
) )
1413imp 124 1  |-  ( ( F : A -1-1-> B  /\  ( C  e.  A  /\  D  e.  A
) )  ->  (
( F `  C
)  =  ( F `
 D )  ->  C  =  D )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   A.wral 2510   -->wf 5322   -1-1->wf1 5323   ` cfv 5326
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fv 5334
This theorem is referenced by:  f1fveq  5912  f1ocnvfvrneq  5922  f1o2ndf1  6392  1dom1el  6992  fidceq  7055  difinfsnlem  7297  difinfsn  7298  pr2cv1  7399  iseqf1olemab  10763  iseqf1olemnanb  10764  f1ghm0to0  13858  uspgr2wlkeq  16215  3dom  16587  pwle2  16599
  Copyright terms: Public domain W3C validator