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

Theorem ffvresb 5721
Description: A necessary and sufficient condition for a restricted function. (Contributed by Mario Carneiro, 14-Nov-2013.)
Assertion
Ref Expression
ffvresb  |-  ( Fun 
F  ->  ( ( F  |`  A ) : A --> B  <->  A. x  e.  A  ( x  e.  dom  F  /\  ( F `  x )  e.  B ) ) )
Distinct variable groups:    x, A    x, B    x, F

Proof of Theorem ffvresb
StepHypRef Expression
1 fdm 5409 . . . . . 6  |-  ( ( F  |`  A ) : A --> B  ->  dom  ( F  |`  A )  =  A )
2 dmres 4963 . . . . . . 7  |-  dom  ( F  |`  A )  =  ( A  i^i  dom  F )
3 inss2 3380 . . . . . . 7  |-  ( A  i^i  dom  F )  C_ 
dom  F
42, 3eqsstri 3211 . . . . . 6  |-  dom  ( F  |`  A )  C_  dom  F
51, 4eqsstrrdi 3232 . . . . 5  |-  ( ( F  |`  A ) : A --> B  ->  A  C_ 
dom  F )
65sselda 3179 . . . 4  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  x  e.  dom  F
)
7 fvres 5578 . . . . . 6  |-  ( x  e.  A  ->  (
( F  |`  A ) `
 x )  =  ( F `  x
) )
87adantl 277 . . . . 5  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  ( ( F  |`  A ) `  x
)  =  ( F `
 x ) )
9 ffvelcdm 5691 . . . . 5  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  ( ( F  |`  A ) `  x
)  e.  B )
108, 9eqeltrrd 2271 . . . 4  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  ( F `  x
)  e.  B )
116, 10jca 306 . . 3  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  ( x  e.  dom  F  /\  ( F `  x )  e.  B
) )
1211ralrimiva 2567 . 2  |-  ( ( F  |`  A ) : A --> B  ->  A. x  e.  A  ( x  e.  dom  F  /\  ( F `  x )  e.  B ) )
13 simpl 109 . . . . . . 7  |-  ( ( x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  x  e.  dom  F )
1413ralimi 2557 . . . . . 6  |-  ( A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  A. x  e.  A  x  e.  dom  F )
15 dfss3 3169 . . . . . 6  |-  ( A 
C_  dom  F  <->  A. x  e.  A  x  e.  dom  F )
1614, 15sylibr 134 . . . . 5  |-  ( A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  A  C_  dom  F )
17 funfn 5284 . . . . . 6  |-  ( Fun 
F  <->  F  Fn  dom  F )
18 fnssres 5367 . . . . . 6  |-  ( ( F  Fn  dom  F  /\  A  C_  dom  F
)  ->  ( F  |`  A )  Fn  A
)
1917, 18sylanb 284 . . . . 5  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( F  |`  A )  Fn  A )
2016, 19sylan2 286 . . . 4  |-  ( ( Fun  F  /\  A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B ) )  ->  ( F  |`  A )  Fn  A
)
21 simpr 110 . . . . . . . 8  |-  ( ( x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  ( F `  x )  e.  B
)
227eleq1d 2262 . . . . . . . 8  |-  ( x  e.  A  ->  (
( ( F  |`  A ) `  x
)  e.  B  <->  ( F `  x )  e.  B
) )
2321, 22imbitrrid 156 . . . . . . 7  |-  ( x  e.  A  ->  (
( x  e.  dom  F  /\  ( F `  x )  e.  B
)  ->  ( ( F  |`  A ) `  x )  e.  B
) )
2423ralimia 2555 . . . . . 6  |-  ( A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  A. x  e.  A  ( ( F  |`  A ) `  x
)  e.  B )
2524adantl 277 . . . . 5  |-  ( ( Fun  F  /\  A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B ) )  ->  A. x  e.  A  ( ( F  |`  A ) `  x )  e.  B
)
26 fnfvrnss 5718 . . . . 5  |-  ( ( ( F  |`  A )  Fn  A  /\  A. x  e.  A  (
( F  |`  A ) `
 x )  e.  B )  ->  ran  ( F  |`  A ) 
C_  B )
2720, 25, 26syl2anc 411 . . . 4  |-  ( ( Fun  F  /\  A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B ) )  ->  ran  ( F  |`  A )  C_  B
)
28 df-f 5258 . . . 4  |-  ( ( F  |`  A ) : A --> B  <->  ( ( F  |`  A )  Fn  A  /\  ran  ( F  |`  A )  C_  B ) )
2920, 27, 28sylanbrc 417 . . 3  |-  ( ( Fun  F  /\  A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B ) )  ->  ( F  |`  A ) : A --> B )
3029ex 115 . 2  |-  ( Fun 
F  ->  ( A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  ( F  |`  A ) : A --> B ) )
3112, 30impbid2 143 1  |-  ( Fun 
F  ->  ( ( F  |`  A ) : A --> B  <->  A. x  e.  A  ( x  e.  dom  F  /\  ( F `  x )  e.  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2164   A.wral 2472    i^i cin 3152    C_ wss 3153   dom cdm 4659   ran crn 4660    |` cres 4661   Fun wfun 5248    Fn wfn 5249   -->wf 5250   ` cfv 5254
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262
This theorem is referenced by:  resflem  5722  tfrcl  6417  frecfcllem  6457  lmbr2  14382  lmff  14417
  Copyright terms: Public domain W3C validator