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

Theorem suppssdc 6438
Description: Show that the support of a function is contained in a set. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by AV, 28-May-2019.) (Proof shortened by SN, 5-Aug-2024.)
Hypotheses
Ref Expression
suppss.f  |-  ( ph  ->  F : A --> B )
suppss.n  |-  ( (
ph  /\  k  e.  ( A  \  W ) )  ->  ( F `  k )  =  Z )
suppssdc.dc  |-  ( ph  ->  A. x  e.  A DECID  x  e.  W )
Assertion
Ref Expression
suppssdc  |-  ( ph  ->  ( F supp  Z ) 
C_  W )
Distinct variable groups:    k, F    ph, k    x, k, W    k, Z    x, A
Allowed substitution hints:    ph( x)    A( k)    B( x, k)    F( x)    Z( x)

Proof of Theorem suppssdc
Dummy variables  f  i  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-supp 6414 . . . 4  |- supp  =  ( f  e.  _V , 
z  e.  _V  |->  { i  e.  dom  f  |  ( f " { i } )  =/=  { z } } )
21elmpocl 6227 . . 3  |-  ( k  e.  ( F supp  Z
)  ->  ( F  e.  _V  /\  Z  e. 
_V ) )
3 suppss.f . . . . . . . . 9  |-  ( ph  ->  F : A --> B )
43ffnd 5490 . . . . . . . 8  |-  ( ph  ->  F  Fn  A )
54adantl 277 . . . . . . 7  |-  ( ( ( F  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  F  Fn  A )
6 simpll 527 . . . . . . 7  |-  ( ( ( F  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  F  e.  _V )
7 simplr 529 . . . . . . 7  |-  ( ( ( F  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  Z  e.  _V )
8 elsuppfng 6420 . . . . . . 7  |-  ( ( F  Fn  A  /\  F  e.  _V  /\  Z  e.  _V )  ->  (
k  e.  ( F supp 
Z )  <->  ( k  e.  A  /\  ( F `  k )  =/=  Z ) ) )
95, 6, 7, 8syl3anc 1274 . . . . . 6  |-  ( ( ( F  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
k  e.  ( F supp 
Z )  <->  ( k  e.  A  /\  ( F `  k )  =/=  Z ) ) )
10 eleq1w 2292 . . . . . . . . . 10  |-  ( x  =  k  ->  (
x  e.  W  <->  k  e.  W ) )
1110dcbid 846 . . . . . . . . 9  |-  ( x  =  k  ->  (DECID  x  e.  W  <-> DECID  k  e.  W )
)
12 suppssdc.dc . . . . . . . . . 10  |-  ( ph  ->  A. x  e.  A DECID  x  e.  W )
1312ad2antlr 489 . . . . . . . . 9  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  ->  A. x  e.  A DECID  x  e.  W
)
14 simpr 110 . . . . . . . . 9  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  ->  k  e.  A )
1511, 13, 14rspcdva 2916 . . . . . . . 8  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  -> DECID  k  e.  W
)
16 eldif 3210 . . . . . . . . . . . 12  |-  ( k  e.  ( A  \  W )  <->  ( k  e.  A  /\  -.  k  e.  W ) )
17 suppss.n . . . . . . . . . . . . 13  |-  ( (
ph  /\  k  e.  ( A  \  W ) )  ->  ( F `  k )  =  Z )
1817adantll 476 . . . . . . . . . . . 12  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  ( A  \  W ) )  ->  ( F `  k )  =  Z )
1916, 18sylan2br 288 . . . . . . . . . . 11  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  ( k  e.  A  /\  -.  k  e.  W
) )  ->  ( F `  k )  =  Z )
2019expr 375 . . . . . . . . . 10  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  ->  ( -.  k  e.  W  ->  ( F `  k )  =  Z ) )
2120a1d 22 . . . . . . . . 9  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  ->  (DECID  k  e.  W  ->  ( -.  k  e.  W  ->  ( F `
 k )  =  Z ) ) )
2221necon1addc 2479 . . . . . . . 8  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  ->  (DECID  k  e.  W  ->  ( ( F `
 k )  =/= 
Z  ->  k  e.  W ) ) )
2315, 22mpd 13 . . . . . . 7  |-  ( ( ( ( F  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  k  e.  A
)  ->  ( ( F `  k )  =/=  Z  ->  k  e.  W ) )
2423expimpd 363 . . . . . 6  |-  ( ( ( F  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
( k  e.  A  /\  ( F `  k
)  =/=  Z )  ->  k  e.  W
) )
259, 24sylbid 150 . . . . 5  |-  ( ( ( F  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
k  e.  ( F supp 
Z )  ->  k  e.  W ) )
2625expcom 116 . . . 4  |-  ( ph  ->  ( ( F  e. 
_V  /\  Z  e.  _V )  ->  ( k  e.  ( F supp  Z
)  ->  k  e.  W ) ) )
2726com23 78 . . 3  |-  ( ph  ->  ( k  e.  ( F supp  Z )  -> 
( ( F  e. 
_V  /\  Z  e.  _V )  ->  k  e.  W ) ) )
282, 27mpdi 43 . 2  |-  ( ph  ->  ( k  e.  ( F supp  Z )  -> 
k  e.  W ) )
2928ssrdv 3234 1  |-  ( ph  ->  ( F supp  Z ) 
C_  W )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 842    = wceq 1398    e. wcel 2202    =/= wne 2403   A.wral 2511   {crab 2515   _Vcvv 2803    \ cdif 3198    C_ wss 3201   {csn 3673   dom cdm 4731   "cima 4734    Fn wfn 5328   -->wf 5329   ` cfv 5333  (class class class)co 6028   supp csupp 6413
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-supp 6414
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator