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

Theorem dff13f 5671
Description: A one-to-one function in terms of function values. Compare Theorem 4.8(iv) of [Monk1] p. 43. (Contributed by NM, 31-Jul-2003.)
Hypotheses
Ref Expression
dff13f.1  |-  F/_ x F
dff13f.2  |-  F/_ y F
Assertion
Ref Expression
dff13f  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  A. x  e.  A  A. y  e.  A  (
( F `  x
)  =  ( F `
 y )  ->  x  =  y )
) )
Distinct variable group:    x, y, A
Allowed substitution hints:    B( x, y)    F( x, y)

Proof of Theorem dff13f
Dummy variables  w  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dff13 5669 . 2  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  A. w  e.  A  A. v  e.  A  (
( F `  w
)  =  ( F `
 v )  ->  w  =  v )
) )
2 dff13f.2 . . . . . . . . 9  |-  F/_ y F
3 nfcv 2281 . . . . . . . . 9  |-  F/_ y
w
42, 3nffv 5431 . . . . . . . 8  |-  F/_ y
( F `  w
)
5 nfcv 2281 . . . . . . . . 9  |-  F/_ y
v
62, 5nffv 5431 . . . . . . . 8  |-  F/_ y
( F `  v
)
74, 6nfeq 2289 . . . . . . 7  |-  F/ y ( F `  w
)  =  ( F `
 v )
8 nfv 1508 . . . . . . 7  |-  F/ y  w  =  v
97, 8nfim 1551 . . . . . 6  |-  F/ y ( ( F `  w )  =  ( F `  v )  ->  w  =  v )
10 nfv 1508 . . . . . 6  |-  F/ v ( ( F `  w )  =  ( F `  y )  ->  w  =  y )
11 fveq2 5421 . . . . . . . 8  |-  ( v  =  y  ->  ( F `  v )  =  ( F `  y ) )
1211eqeq2d 2151 . . . . . . 7  |-  ( v  =  y  ->  (
( F `  w
)  =  ( F `
 v )  <->  ( F `  w )  =  ( F `  y ) ) )
13 equequ2 1689 . . . . . . 7  |-  ( v  =  y  ->  (
w  =  v  <->  w  =  y ) )
1412, 13imbi12d 233 . . . . . 6  |-  ( v  =  y  ->  (
( ( F `  w )  =  ( F `  v )  ->  w  =  v )  <->  ( ( F `
 w )  =  ( F `  y
)  ->  w  =  y ) ) )
159, 10, 14cbvral 2650 . . . . 5  |-  ( A. v  e.  A  (
( F `  w
)  =  ( F `
 v )  ->  w  =  v )  <->  A. y  e.  A  ( ( F `  w
)  =  ( F `
 y )  ->  w  =  y )
)
1615ralbii 2441 . . . 4  |-  ( A. w  e.  A  A. v  e.  A  (
( F `  w
)  =  ( F `
 v )  ->  w  =  v )  <->  A. w  e.  A  A. y  e.  A  (
( F `  w
)  =  ( F `
 y )  ->  w  =  y )
)
17 nfcv 2281 . . . . . 6  |-  F/_ x A
18 dff13f.1 . . . . . . . . 9  |-  F/_ x F
19 nfcv 2281 . . . . . . . . 9  |-  F/_ x w
2018, 19nffv 5431 . . . . . . . 8  |-  F/_ x
( F `  w
)
21 nfcv 2281 . . . . . . . . 9  |-  F/_ x
y
2218, 21nffv 5431 . . . . . . . 8  |-  F/_ x
( F `  y
)
2320, 22nfeq 2289 . . . . . . 7  |-  F/ x
( F `  w
)  =  ( F `
 y )
24 nfv 1508 . . . . . . 7  |-  F/ x  w  =  y
2523, 24nfim 1551 . . . . . 6  |-  F/ x
( ( F `  w )  =  ( F `  y )  ->  w  =  y )
2617, 25nfralxy 2471 . . . . 5  |-  F/ x A. y  e.  A  ( ( F `  w )  =  ( F `  y )  ->  w  =  y )
27 nfv 1508 . . . . 5  |-  F/ w A. y  e.  A  ( ( F `  x )  =  ( F `  y )  ->  x  =  y )
28 fveq2 5421 . . . . . . . 8  |-  ( w  =  x  ->  ( F `  w )  =  ( F `  x ) )
2928eqeq1d 2148 . . . . . . 7  |-  ( w  =  x  ->  (
( F `  w
)  =  ( F `
 y )  <->  ( F `  x )  =  ( F `  y ) ) )
30 equequ1 1688 . . . . . . 7  |-  ( w  =  x  ->  (
w  =  y  <->  x  =  y ) )
3129, 30imbi12d 233 . . . . . 6  |-  ( w  =  x  ->  (
( ( F `  w )  =  ( F `  y )  ->  w  =  y )  <->  ( ( F `
 x )  =  ( F `  y
)  ->  x  =  y ) ) )
3231ralbidv 2437 . . . . 5  |-  ( w  =  x  ->  ( A. y  e.  A  ( ( F `  w )  =  ( F `  y )  ->  w  =  y )  <->  A. y  e.  A  ( ( F `  x )  =  ( F `  y )  ->  x  =  y ) ) )
3326, 27, 32cbvral 2650 . . . 4  |-  ( A. w  e.  A  A. y  e.  A  (
( F `  w
)  =  ( F `
 y )  ->  w  =  y )  <->  A. x  e.  A  A. y  e.  A  (
( F `  x
)  =  ( F `
 y )  ->  x  =  y )
)
3416, 33bitri 183 . . 3  |-  ( A. w  e.  A  A. v  e.  A  (
( F `  w
)  =  ( F `
 v )  ->  w  =  v )  <->  A. x  e.  A  A. y  e.  A  (
( F `  x
)  =  ( F `
 y )  ->  x  =  y )
)
3534anbi2i 452 . 2  |-  ( ( F : A --> B  /\  A. w  e.  A  A. v  e.  A  (
( F `  w
)  =  ( F `
 v )  ->  w  =  v )
)  <->  ( F : A
--> B  /\  A. x  e.  A  A. y  e.  A  ( ( F `  x )  =  ( F `  y )  ->  x  =  y ) ) )
361, 35bitri 183 1  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  A. x  e.  A  A. y  e.  A  (
( F `  x
)  =  ( F `
 y )  ->  x  =  y )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331   F/_wnfc 2268   A.wral 2416   -->wf 5119   -1-1->wf1 5120   ` cfv 5123
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fv 5131
This theorem is referenced by:  f1mpt  5672  dom2lem  6666
  Copyright terms: Public domain W3C validator