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

Theorem funimass3 5799
Description: A kind of contraposition law that infers an image subclass from a subclass of a preimage. Raph Levien remarks: "Likely this could be proved directly, and fvimacnv 5798 would be the special case of  A being a singleton, but it works this way round too." (Contributed by Raph Levien, 20-Nov-2006.)
Assertion
Ref Expression
funimass3  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A 
C_  ( `' F " B ) ) )

Proof of Theorem funimass3
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 funimass4 5732 . . 3  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A. x  e.  A  ( F `  x )  e.  B ) )
2 ssel 3236 . . . . . 6  |-  ( A 
C_  dom  F  ->  ( x  e.  A  ->  x  e.  dom  F ) )
3 fvimacnv 5798 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( ( F `  x )  e.  B  <->  x  e.  ( `' F " B ) ) )
43ex 115 . . . . . 6  |-  ( Fun 
F  ->  ( x  e.  dom  F  ->  (
( F `  x
)  e.  B  <->  x  e.  ( `' F " B ) ) ) )
52, 4syl9r 73 . . . . 5  |-  ( Fun 
F  ->  ( A  C_ 
dom  F  ->  ( x  e.  A  ->  (
( F `  x
)  e.  B  <->  x  e.  ( `' F " B ) ) ) ) )
65imp31 256 . . . 4  |-  ( ( ( Fun  F  /\  A  C_  dom  F )  /\  x  e.  A
)  ->  ( ( F `  x )  e.  B  <->  x  e.  ( `' F " B ) ) )
76ralbidva 2540 . . 3  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( A. x  e.  A  ( F `  x )  e.  B  <->  A. x  e.  A  x  e.  ( `' F " B ) ) )
81, 7bitrd 188 . 2  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A. x  e.  A  x  e.  ( `' F " B ) ) )
9 dfss3 3230 . 2  |-  ( A 
C_  ( `' F " B )  <->  A. x  e.  A  x  e.  ( `' F " B ) )
108, 9bitr4di 198 1  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A 
C_  ( `' F " B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2205   A.wral 2522    C_ wss 3214   `'ccnv 4753   dom cdm 4754   "cima 4757   Fun wfun 5351   ` 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-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365
This theorem is referenced by:  funimass5  5800  funconstss  5801  fimacnv  5811  rinvf1o  6008  iscnp3  15194  cnpnei  15210  cncnp  15221
  Copyright terms: Public domain W3C validator