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

Theorem respreima 5783
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 5363 . . 3  |-  ( Fun 
F  <->  F  Fn  dom  F )
2 elin 3392 . . . . . . . . 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 5672 . . . . . . . . . 10  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
76eleq1d 2300 . . . . . . . . 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 564 . . . . 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 5434 . . . . . . . 8  |-  ( F  Fn  dom  F  ->  Fun  F )
15 funres 5374 . . . . . . . 8  |-  ( Fun 
F  ->  Fun  ( F  |`  B ) )
1614, 15syl 14 . . . . . . 7  |-  ( F  Fn  dom  F  ->  Fun  ( F  |`  B ) )
17 dmres 5040 . . . . . . 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 5336 . . . . . 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 5775 . . . . 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 3392 . . . . 5  |-  ( x  e.  ( ( `' F " A )  i^i  B )  <->  ( x  e.  ( `' F " A )  /\  x  e.  B ) )
24 elpreima 5775 . . . . . 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 2229 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 1398    e. wcel 2202    i^i cin 3200   `'ccnv 4730   dom cdm 4731    |` cres 4733   "cima 4734   Fun wfun 5327    Fn wfn 5328   ` cfv 5333
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 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator