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

Theorem nn0supp 9552
Description: Two ways to write the support of a function on  NN0. (Contributed by Mario Carneiro, 29-Dec-2014.)
Assertion
Ref Expression
nn0supp  |-  ( F : I --> NN0  ->  ( `' F " ( _V 
\  { 0 } ) )  =  ( `' F " NN ) )

Proof of Theorem nn0supp
StepHypRef Expression
1 dfn2 9509 . . . 4  |-  NN  =  ( NN0  \  { 0 } )
2 invdif 3463 . . . 4  |-  ( NN0 
i^i  ( _V  \  { 0 } ) )  =  ( NN0  \  { 0 } )
31, 2eqtr4i 2256 . . 3  |-  NN  =  ( NN0  i^i  ( _V 
\  { 0 } ) )
43imaeq2i 5099 . 2  |-  ( `' F " NN )  =  ( `' F " ( NN0  i^i  ( _V  \  { 0 } ) ) )
5 ffun 5511 . . . 4  |-  ( F : I --> NN0  ->  Fun 
F )
6 inpreima 5803 . . . 4  |-  ( Fun 
F  ->  ( `' F " ( NN0  i^i  ( _V  \  { 0 } ) ) )  =  ( ( `' F " NN0 )  i^i  ( `' F "
( _V  \  {
0 } ) ) ) )
75, 6syl 14 . . 3  |-  ( F : I --> NN0  ->  ( `' F " ( NN0 
i^i  ( _V  \  { 0 } ) ) )  =  ( ( `' F " NN0 )  i^i  ( `' F " ( _V 
\  { 0 } ) ) ) )
8 cnvimass 5125 . . . . 5  |-  ( `' F " ( _V 
\  { 0 } ) )  C_  dom  F
9 fdm 5514 . . . . . 6  |-  ( F : I --> NN0  ->  dom 
F  =  I )
10 fimacnv 5806 . . . . . 6  |-  ( F : I --> NN0  ->  ( `' F " NN0 )  =  I )
119, 10eqtr4d 2268 . . . . 5  |-  ( F : I --> NN0  ->  dom 
F  =  ( `' F " NN0 )
)
128, 11sseqtrid 3288 . . . 4  |-  ( F : I --> NN0  ->  ( `' F " ( _V 
\  { 0 } ) )  C_  ( `' F " NN0 )
)
13 sseqin2 3440 . . . 4  |-  ( ( `' F " ( _V 
\  { 0 } ) )  C_  ( `' F " NN0 )  <->  ( ( `' F " NN0 )  i^i  ( `' F " ( _V 
\  { 0 } ) ) )  =  ( `' F "
( _V  \  {
0 } ) ) )
1412, 13sylib 122 . . 3  |-  ( F : I --> NN0  ->  ( ( `' F " NN0 )  i^i  ( `' F " ( _V 
\  { 0 } ) ) )  =  ( `' F "
( _V  \  {
0 } ) ) )
157, 14eqtrd 2265 . 2  |-  ( F : I --> NN0  ->  ( `' F " ( NN0 
i^i  ( _V  \  { 0 } ) ) )  =  ( `' F " ( _V 
\  { 0 } ) ) )
164, 15eqtr2id 2278 1  |-  ( F : I --> NN0  ->  ( `' F " ( _V 
\  { 0 } ) )  =  ( `' F " NN ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398   _Vcvv 2813    \ cdif 3208    i^i cin 3210    C_ wss 3211   {csn 3689   `'ccnv 4748   dom cdm 4749   "cima 4752   Fun wfun 5346   -->wf 5348   0cc0 8127   NNcn 9237   NN0cn0 9496
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-in1 619  ax-in2 620  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-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-ov 6053  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-inn 9238  df-n0 9497
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator