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

Theorem respreima 5731
Description: The preimage of a restricted function. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
respreima  |-  ( Fun 
F  ->  ( `' ( F  |`  B )
" A )  =  ( ( `' F " A )  i^i  B
) )

Proof of Theorem respreima
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 funfn 5320 . . 3  |-  ( Fun 
F  <->  F  Fn  dom  F )
2 elin 3364 . . . . . . . . 9  |-  ( x  e.  ( B  i^i  dom 
F )  <->  ( x  e.  B  /\  x  e.  dom  F ) )
3 ancom 266 . . . . . . . . 9  |-  ( ( x  e.  B  /\  x  e.  dom  F )  <-> 
( x  e.  dom  F  /\  x  e.  B
) )
42, 3bitri 184 . . . . . . . 8  |-  ( x  e.  ( B  i^i  dom 
F )  <->  ( x  e.  dom  F  /\  x  e.  B ) )
54anbi1i 458 . . . . . . 7  |-  ( ( x  e.  ( B  i^i  dom  F )  /\  ( ( F  |`  B ) `  x
)  e.  A )  <-> 
( ( x  e. 
dom  F  /\  x  e.  B )  /\  (
( F  |`  B ) `
 x )  e.  A ) )
6 fvres 5623 . . . . . . . . . 10  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
76eleq1d 2276 . . . . . . . . 9  |-  ( x  e.  B  ->  (
( ( F  |`  B ) `  x
)  e.  A  <->  ( F `  x )  e.  A
) )
87adantl 277 . . . . . . . 8  |-  ( ( x  e.  dom  F  /\  x  e.  B
)  ->  ( (
( F  |`  B ) `
 x )  e.  A  <->  ( F `  x )  e.  A
) )
98pm5.32i 454 . . . . . . 7  |-  ( ( ( x  e.  dom  F  /\  x  e.  B
)  /\  ( ( F  |`  B ) `  x )  e.  A
)  <->  ( ( x  e.  dom  F  /\  x  e.  B )  /\  ( F `  x
)  e.  A ) )
105, 9bitri 184 . . . . . 6  |-  ( ( x  e.  ( B  i^i  dom  F )  /\  ( ( F  |`  B ) `  x
)  e.  A )  <-> 
( ( x  e. 
dom  F  /\  x  e.  B )  /\  ( F `  x )  e.  A ) )
1110a1i 9 . . . . 5  |-  ( F  Fn  dom  F  -> 
( ( x  e.  ( B  i^i  dom  F )  /\  ( ( F  |`  B ) `  x )  e.  A
)  <->  ( ( x  e.  dom  F  /\  x  e.  B )  /\  ( F `  x
)  e.  A ) ) )
12 an32 562 . . . . 5  |-  ( ( ( x  e.  dom  F  /\  x  e.  B
)  /\  ( F `  x )  e.  A
)  <->  ( ( x  e.  dom  F  /\  ( F `  x )  e.  A )  /\  x  e.  B )
)
1311, 12bitrdi 196 . . . 4  |-  ( F  Fn  dom  F  -> 
( ( x  e.  ( B  i^i  dom  F )  /\  ( ( F  |`  B ) `  x )  e.  A
)  <->  ( ( x  e.  dom  F  /\  ( F `  x )  e.  A )  /\  x  e.  B )
) )
14 fnfun 5390 . . . . . . . 8  |-  ( F  Fn  dom  F  ->  Fun  F )
15 funres 5331 . . . . . . . 8  |-  ( Fun 
F  ->  Fun  ( F  |`  B ) )
1614, 15syl 14 . . . . . . 7  |-  ( F  Fn  dom  F  ->  Fun  ( F  |`  B ) )
17 dmres 4999 . . . . . . 7  |-  dom  ( F  |`  B )  =  ( B  i^i  dom  F )
1816, 17jctir 313 . . . . . 6  |-  ( F  Fn  dom  F  -> 
( Fun  ( F  |`  B )  /\  dom  ( F  |`  B )  =  ( B  i^i  dom 
F ) ) )
19 df-fn 5293 . . . . . 6  |-  ( ( F  |`  B )  Fn  ( B  i^i  dom  F )  <->  ( Fun  ( F  |`  B )  /\  dom  ( F  |`  B )  =  ( B  i^i  dom 
F ) ) )
2018, 19sylibr 134 . . . . 5  |-  ( F  Fn  dom  F  -> 
( F  |`  B )  Fn  ( B  i^i  dom 
F ) )
21 elpreima 5722 . . . . 5  |-  ( ( F  |`  B )  Fn  ( B  i^i  dom  F )  ->  ( x  e.  ( `' ( F  |`  B ) " A
)  <->  ( x  e.  ( B  i^i  dom  F )  /\  ( ( F  |`  B ) `  x )  e.  A
) ) )
2220, 21syl 14 . . . 4  |-  ( F  Fn  dom  F  -> 
( x  e.  ( `' ( F  |`  B ) " A
)  <->  ( x  e.  ( B  i^i  dom  F )  /\  ( ( F  |`  B ) `  x )  e.  A
) ) )
23 elin 3364 . . . . 5  |-  ( x  e.  ( ( `' F " A )  i^i  B )  <->  ( x  e.  ( `' F " A )  /\  x  e.  B ) )
24 elpreima 5722 . . . . . 6  |-  ( F  Fn  dom  F  -> 
( x  e.  ( `' F " A )  <-> 
( x  e.  dom  F  /\  ( F `  x )  e.  A
) ) )
2524anbi1d 465 . . . . 5  |-  ( F  Fn  dom  F  -> 
( ( x  e.  ( `' F " A )  /\  x  e.  B )  <->  ( (
x  e.  dom  F  /\  ( F `  x
)  e.  A )  /\  x  e.  B
) ) )
2623, 25bitrid 192 . . . 4  |-  ( F  Fn  dom  F  -> 
( x  e.  ( ( `' F " A )  i^i  B
)  <->  ( ( x  e.  dom  F  /\  ( F `  x )  e.  A )  /\  x  e.  B )
) )
2713, 22, 263bitr4d 220 . . 3  |-  ( F  Fn  dom  F  -> 
( x  e.  ( `' ( F  |`  B ) " A
)  <->  x  e.  (
( `' F " A )  i^i  B
) ) )
281, 27sylbi 121 . 2  |-  ( Fun 
F  ->  ( x  e.  ( `' ( F  |`  B ) " A
)  <->  x  e.  (
( `' F " A )  i^i  B
) ) )
2928eqrdv 2205 1  |-  ( Fun 
F  ->  ( `' ( F  |`  B )
" A )  =  ( ( `' F " A )  i^i  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2178    i^i cin 3173   `'ccnv 4692   dom cdm 4693    |` cres 4695   "cima 4696   Fun wfun 5284    Fn wfn 5285   ` cfv 5290
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-fv 5298
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator