MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  funimass3 Structured version   Unicode version

Theorem funimass3 5998
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 5997 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 5919 . . 3  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A. x  e.  A  ( F `  x )  e.  B ) )
2 ssel 3498 . . . . . 6  |-  ( A 
C_  dom  F  ->  ( x  e.  A  ->  x  e.  dom  F ) )
3 fvimacnv 5997 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( ( F `  x )  e.  B  <->  x  e.  ( `' F " B ) ) )
43ex 434 . . . . . 6  |-  ( Fun 
F  ->  ( x  e.  dom  F  ->  (
( F `  x
)  e.  B  <->  x  e.  ( `' F " B ) ) ) )
52, 4syl9r 72 . . . . 5  |-  ( Fun 
F  ->  ( A  C_ 
dom  F  ->  ( x  e.  A  ->  (
( F `  x
)  e.  B  <->  x  e.  ( `' F " B ) ) ) ) )
65imp31 432 . . . 4  |-  ( ( ( Fun  F  /\  A  C_  dom  F )  /\  x  e.  A
)  ->  ( ( F `  x )  e.  B  <->  x  e.  ( `' F " B ) ) )
76ralbidva 2900 . . 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 253 . 2  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A. x  e.  A  x  e.  ( `' F " B ) ) )
9 dfss3 3494 . 2  |-  ( A 
C_  ( `' F " B )  <->  A. x  e.  A  x  e.  ( `' F " B ) )
108, 9syl6bbr 263 1  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( ( F " A )  C_  B  <->  A 
C_  ( `' F " B ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    e. wcel 1767   A.wral 2814    C_ wss 3476   `'ccnv 4998   dom cdm 4999   "cima 5002   Fun wfun 5582   ` cfv 5588
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pr 4686
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-id 4795  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5551  df-fun 5590  df-fn 5591  df-fv 5596
This theorem is referenced by:  funimass5  5999  funconstss  6000  fvimacnvALT  6001  fimacnv  6014  r0weon  8391  iscnp3  19551  cnpnei  19571  cnclsi  19579  cncls  19581  cncnp  19587  1stccnp  19769  txcnpi  19936  xkoco2cn  19986  xkococnlem  19987  basqtop  20039  kqnrmlem1  20071  kqnrmlem2  20072  reghmph  20121  nrmhmph  20122  elfm3  20278  rnelfm  20281  symgtgp  20427  tgpconcompeqg  20437  eltsms  20458  ucnprima  20612  plyco0  22416  plyeq0  22435  xrlimcnp  23123  rinvf1o  27242  xppreima  27256  cvmliftmolem1  28477  cvmlift2lem9  28507  cvmlift3lem6  28520  mclsppslem  28694
  Copyright terms: Public domain W3C validator