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

Theorem dff13f 5838
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 5836 . 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 2347 . . . . . . . . 9  |-  F/_ y
w
42, 3nffv 5585 . . . . . . . 8  |-  F/_ y
( F `  w
)
5 nfcv 2347 . . . . . . . . 9  |-  F/_ y
v
62, 5nffv 5585 . . . . . . . 8  |-  F/_ y
( F `  v
)
74, 6nfeq 2355 . . . . . . 7  |-  F/ y ( F `  w
)  =  ( F `
 v )
8 nfv 1550 . . . . . . 7  |-  F/ y  w  =  v
97, 8nfim 1594 . . . . . 6  |-  F/ y ( ( F `  w )  =  ( F `  v )  ->  w  =  v )
10 nfv 1550 . . . . . 6  |-  F/ v ( ( F `  w )  =  ( F `  y )  ->  w  =  y )
11 fveq2 5575 . . . . . . . 8  |-  ( v  =  y  ->  ( F `  v )  =  ( F `  y ) )
1211eqeq2d 2216 . . . . . . 7  |-  ( v  =  y  ->  (
( F `  w
)  =  ( F `
 v )  <->  ( F `  w )  =  ( F `  y ) ) )
13 equequ2 1735 . . . . . . 7  |-  ( v  =  y  ->  (
w  =  v  <->  w  =  y ) )
1412, 13imbi12d 234 . . . . . 6  |-  ( v  =  y  ->  (
( ( F `  w )  =  ( F `  v )  ->  w  =  v )  <->  ( ( F `
 w )  =  ( F `  y
)  ->  w  =  y ) ) )
159, 10, 14cbvral 2733 . . . . 5  |-  ( A. v  e.  A  (
( F `  w
)  =  ( F `
 v )  ->  w  =  v )  <->  A. y  e.  A  ( ( F `  w
)  =  ( F `
 y )  ->  w  =  y )
)
1615ralbii 2511 . . . 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 2347 . . . . . 6  |-  F/_ x A
18 dff13f.1 . . . . . . . . 9  |-  F/_ x F
19 nfcv 2347 . . . . . . . . 9  |-  F/_ x w
2018, 19nffv 5585 . . . . . . . 8  |-  F/_ x
( F `  w
)
21 nfcv 2347 . . . . . . . . 9  |-  F/_ x
y
2218, 21nffv 5585 . . . . . . . 8  |-  F/_ x
( F `  y
)
2320, 22nfeq 2355 . . . . . . 7  |-  F/ x
( F `  w
)  =  ( F `
 y )
24 nfv 1550 . . . . . . 7  |-  F/ x  w  =  y
2523, 24nfim 1594 . . . . . 6  |-  F/ x
( ( F `  w )  =  ( F `  y )  ->  w  =  y )
2617, 25nfralxy 2543 . . . . 5  |-  F/ x A. y  e.  A  ( ( F `  w )  =  ( F `  y )  ->  w  =  y )
27 nfv 1550 . . . . 5  |-  F/ w A. y  e.  A  ( ( F `  x )  =  ( F `  y )  ->  x  =  y )
28 fveq2 5575 . . . . . . . 8  |-  ( w  =  x  ->  ( F `  w )  =  ( F `  x ) )
2928eqeq1d 2213 . . . . . . 7  |-  ( w  =  x  ->  (
( F `  w
)  =  ( F `
 y )  <->  ( F `  x )  =  ( F `  y ) ) )
30 equequ1 1734 . . . . . . 7  |-  ( w  =  x  ->  (
w  =  y  <->  x  =  y ) )
3129, 30imbi12d 234 . . . . . 6  |-  ( w  =  x  ->  (
( ( F `  w )  =  ( F `  y )  ->  w  =  y )  <->  ( ( F `
 x )  =  ( F `  y
)  ->  x  =  y ) ) )
3231ralbidv 2505 . . . . 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 2733 . . . 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 184 . . 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 457 . 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 184 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 104    <-> wb 105    = wceq 1372   F/_wnfc 2334   A.wral 2483   -->wf 5266   -1-1->wf1 5267   ` cfv 5270
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fv 5278
This theorem is referenced by:  f1mpt  5839  dom2lem  6862
  Copyright terms: Public domain W3C validator