Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fsuppeq Structured version   Unicode version

Theorem fsuppeq 30675
Description: Two ways of writing the support of a function with known codomain. MOVABLE SHORTEN nn0supp (Contributed by Stefan O'Rear, 9-Jul-2015.) (New usage is discouraged.) Use frnsuppeq 6913 instead.
Assertion
Ref Expression
fsuppeq  |-  ( F : I --> S  -> 
( `' F "
( _V  \  { X } ) )  =  ( `' F "
( S  \  { X } ) ) )

Proof of Theorem fsuppeq
StepHypRef Expression
1 invdif 3739 . . 3  |-  ( S  i^i  ( _V  \  { X } ) )  =  ( S  \  { X } )
21imaeq2i 5335 . 2  |-  ( `' F " ( S  i^i  ( _V  \  { X } ) ) )  =  ( `' F " ( S 
\  { X }
) )
3 ffun 5733 . . . 4  |-  ( F : I --> S  ->  Fun  F )
4 inpreima 6008 . . . 4  |-  ( Fun 
F  ->  ( `' F " ( S  i^i  ( _V  \  { X } ) ) )  =  ( ( `' F " S )  i^i  ( `' F " ( _V  \  { X } ) ) ) )
53, 4syl 16 . . 3  |-  ( F : I --> S  -> 
( `' F "
( S  i^i  ( _V  \  { X }
) ) )  =  ( ( `' F " S )  i^i  ( `' F " ( _V 
\  { X }
) ) ) )
6 cnvimass 5357 . . . . 5  |-  ( `' F " ( _V 
\  { X }
) )  C_  dom  F
7 fdm 5735 . . . . . 6  |-  ( F : I --> S  ->  dom  F  =  I )
8 fimacnv 6013 . . . . . 6  |-  ( F : I --> S  -> 
( `' F " S )  =  I )
97, 8eqtr4d 2511 . . . . 5  |-  ( F : I --> S  ->  dom  F  =  ( `' F " S ) )
106, 9syl5sseq 3552 . . . 4  |-  ( F : I --> S  -> 
( `' F "
( _V  \  { X } ) )  C_  ( `' F " S ) )
11 sseqin2 3717 . . . 4  |-  ( ( `' F " ( _V 
\  { X }
) )  C_  ( `' F " S )  <-> 
( ( `' F " S )  i^i  ( `' F " ( _V 
\  { X }
) ) )  =  ( `' F "
( _V  \  { X } ) ) )
1210, 11sylib 196 . . 3  |-  ( F : I --> S  -> 
( ( `' F " S )  i^i  ( `' F " ( _V 
\  { X }
) ) )  =  ( `' F "
( _V  \  { X } ) ) )
135, 12eqtrd 2508 . 2  |-  ( F : I --> S  -> 
( `' F "
( S  i^i  ( _V  \  { X }
) ) )  =  ( `' F "
( _V  \  { X } ) ) )
142, 13syl5reqr 2523 1  |-  ( F : I --> S  -> 
( `' F "
( _V  \  { X } ) )  =  ( `' F "
( S  \  { X } ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1379   _Vcvv 3113    \ cdif 3473    i^i cin 3475    C_ wss 3476   {csn 4027   `'ccnv 4998   dom cdm 4999   "cima 5002   Fun wfun 5582   -->wf 5584
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-f 5592  df-fv 5596
This theorem is referenced by:  pwfi2f1o  30676
  Copyright terms: Public domain W3C validator