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

Theorem ffvresb 5845
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 5519 . . . . . 6  |-  ( ( F  |`  A ) : A --> B  ->  dom  ( F  |`  A )  =  A )
2 dmres 5064 . . . . . . 7  |-  dom  ( F  |`  A )  =  ( A  i^i  dom  F )
3 inss2 3446 . . . . . . 7  |-  ( A  i^i  dom  F )  C_ 
dom  F
42, 3eqsstri 3274 . . . . . 6  |-  dom  ( F  |`  A )  C_  dom  F
51, 4eqsstrrdi 3295 . . . . 5  |-  ( ( F  |`  A ) : A --> B  ->  A  C_ 
dom  F )
65sselda 3242 . . . 4  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  x  e.  dom  F
)
7 fvres 5699 . . . . . 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 5815 . . . . 5  |-  ( ( ( F  |`  A ) : A --> B  /\  x  e.  A )  ->  ( ( F  |`  A ) `  x
)  e.  B )
108, 9eqeltrrd 2312 . . . 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 2617 . 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 2607 . . . . . 6  |-  ( A. x  e.  A  (
x  e.  dom  F  /\  ( F `  x
)  e.  B )  ->  A. x  e.  A  x  e.  dom  F )
15 dfss3 3230 . . . . . 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 5387 . . . . . 6  |-  ( Fun 
F  <->  F  Fn  dom  F )
18 fnssres 5476 . . . . . 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 2303 . . . . . . . 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 2605 . . . . . 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 5842 . . . . 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 5361 . . . 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 1398    e. wcel 2205   A.wral 2522    i^i cin 3213    C_ wss 3214   dom cdm 4754   ran crn 4755    |` cres 4756   Fun wfun 5351    Fn wfn 5352   -->wf 5353   ` 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-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365
This theorem is referenced by:  resflem  5846  tfrcl  6608  frecfcllem  6648  lmbr2  15205  lmff  15240
  Copyright terms: Public domain W3C validator