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 31205
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 6929 instead.
Assertion
Ref Expression
fsuppeq  |-  ( F : I --> S  -> 
( `' F "
( _V  \  { X } ) )  =  ( `' F "
( S  \  { X } ) ) )

Proof of Theorem fsuppeq
StepHypRef Expression
1 invdif 3746 . . 3  |-  ( S  i^i  ( _V  \  { X } ) )  =  ( S  \  { X } )
21imaeq2i 5345 . 2  |-  ( `' F " ( S  i^i  ( _V  \  { X } ) ) )  =  ( `' F " ( S 
\  { X }
) )
3 ffun 5739 . . . 4  |-  ( F : I --> S  ->  Fun  F )
4 inpreima 6015 . . . 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 5367 . . . . 5  |-  ( `' F " ( _V 
\  { X }
) )  C_  dom  F
7 fdm 5741 . . . . . 6  |-  ( F : I --> S  ->  dom  F  =  I )
8 fimacnv 6020 . . . . . 6  |-  ( F : I --> S  -> 
( `' F " S )  =  I )
97, 8eqtr4d 2501 . . . . 5  |-  ( F : I --> S  ->  dom  F  =  ( `' F " S ) )
106, 9syl5sseq 3547 . . . 4  |-  ( F : I --> S  -> 
( `' F "
( _V  \  { X } ) )  C_  ( `' F " S ) )
11 sseqin2 3713 . . . 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 2498 . 2  |-  ( F : I --> S  -> 
( `' F "
( S  i^i  ( _V  \  { X }
) ) )  =  ( `' F "
( _V  \  { X } ) ) )
142, 13syl5reqr 2513 1  |-  ( F : I --> S  -> 
( `' F "
( _V  \  { X } ) )  =  ( `' F "
( S  \  { X } ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1395   _Vcvv 3109    \ cdif 3468    i^i cin 3470    C_ wss 3471   {csn 4032   `'ccnv 5007   dom cdm 5008   "cima 5011   Fun wfun 5588   -->wf 5590
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pr 4695
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-opab 4516  df-id 4804  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-fv 5602
This theorem is referenced by:  pwfi2f1o  31206
  Copyright terms: Public domain W3C validator