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

Theorem f1veqaeq 5893
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 5892 . . 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 5627 . . . . . . . 8  |-  ( c  =  C  ->  ( F `  c )  =  ( F `  C ) )
32eqeq1d 2238 . . . . . . 7  |-  ( c  =  C  ->  (
( F `  c
)  =  ( F `
 d )  <->  ( F `  C )  =  ( F `  d ) ) )
4 eqeq1 2236 . . . . . . 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 5627 . . . . . . . 8  |-  ( d  =  D  ->  ( F `  d )  =  ( F `  D ) )
76eqeq2d 2241 . . . . . . 7  |-  ( d  =  D  ->  (
( F `  C
)  =  ( F `
 d )  <->  ( F `  C )  =  ( F `  D ) ) )
8 eqeq2 2239 . . . . . . 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 2920 . . . . 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 1395    e. wcel 2200   A.wral 2508   -->wf 5314   -1-1->wf1 5315   ` cfv 5318
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fv 5326
This theorem is referenced by:  f1fveq  5896  f1ocnvfvrneq  5906  f1o2ndf1  6374  fidceq  7031  difinfsnlem  7266  difinfsn  7267  pr2cv1  7368  iseqf1olemab  10724  iseqf1olemnanb  10725  f1ghm0to0  13809  uspgr2wlkeq  16076  1dom1el  16354  pwle2  16364
  Copyright terms: Public domain W3C validator