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

Theorem f1veqaeq 5948
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 5947 . . 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 5675 . . . . . . . 8  |-  ( c  =  C  ->  ( F `  c )  =  ( F `  C ) )
32eqeq1d 2243 . . . . . . 7  |-  ( c  =  C  ->  (
( F `  c
)  =  ( F `
 d )  <->  ( F `  C )  =  ( F `  d ) ) )
4 eqeq1 2241 . . . . . . 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 5675 . . . . . . . 8  |-  ( d  =  D  ->  ( F `  d )  =  ( F `  D ) )
76eqeq2d 2246 . . . . . . 7  |-  ( d  =  D  ->  (
( F `  C
)  =  ( F `
 d )  <->  ( F `  C )  =  ( F `  D ) ) )
8 eqeq2 2244 . . . . . . 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 2937 . . . . 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 1398    e. wcel 2205   A.wral 2522   -->wf 5353   -1-1->wf1 5354   ` cfv 5357
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fv 5365
This theorem is referenced by:  f1fveq  5951  f1ocnvfvrneq  5961  f1o2ndf1  6437  1dom1el  7073  fidceq  7137  difinfsnlem  7403  difinfsn  7404  pr2cv1  7505  iseqf1olemab  10888  iseqf1olemnanb  10889  f1ghm0to0  14025  uspgr2wlkeq  16486  3dom  16888  pwle2  16898
  Copyright terms: Public domain W3C validator