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

Theorem suppval 6415
Description: The value of the operation constructing the support of a function. (Contributed by AV, 31-Mar-2019.) (Revised by AV, 6-Apr-2019.)
Assertion
Ref Expression
suppval  |-  ( ( X  e.  V  /\  Z  e.  W )  ->  ( X supp  Z )  =  { i  e. 
dom  X  |  ( X " { i } )  =/=  { Z } } )
Distinct variable groups:    i, X    i, Z
Allowed substitution hints:    V( i)    W( i)

Proof of Theorem suppval
Dummy variables  x  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-supp 6414 . . 3  |- supp  =  ( x  e.  _V , 
z  e.  _V  |->  { i  e.  dom  x  |  ( x " { i } )  =/=  { z } } )
21a1i 9 . 2  |-  ( ( X  e.  V  /\  Z  e.  W )  -> supp  =  ( x  e. 
_V ,  z  e. 
_V  |->  { i  e. 
dom  x  |  ( x " { i } )  =/=  {
z } } ) )
3 dmeq 4937 . . . . 5  |-  ( x  =  X  ->  dom  x  =  dom  X )
43adantr 276 . . . 4  |-  ( ( x  =  X  /\  z  =  Z )  ->  dom  x  =  dom  X )
5 imaeq1 5077 . . . . . 6  |-  ( x  =  X  ->  (
x " { i } )  =  ( X " { i } ) )
65adantr 276 . . . . 5  |-  ( ( x  =  X  /\  z  =  Z )  ->  ( x " {
i } )  =  ( X " {
i } ) )
7 sneq 3684 . . . . . 6  |-  ( z  =  Z  ->  { z }  =  { Z } )
87adantl 277 . . . . 5  |-  ( ( x  =  X  /\  z  =  Z )  ->  { z }  =  { Z } )
96, 8neeq12d 2423 . . . 4  |-  ( ( x  =  X  /\  z  =  Z )  ->  ( ( x " { i } )  =/=  { z }  <-> 
( X " {
i } )  =/= 
{ Z } ) )
104, 9rabeqbidv 2798 . . 3  |-  ( ( x  =  X  /\  z  =  Z )  ->  { i  e.  dom  x  |  ( x " { i } )  =/=  { z } }  =  { i  e.  dom  X  | 
( X " {
i } )  =/= 
{ Z } }
)
1110adantl 277 . 2  |-  ( ( ( X  e.  V  /\  Z  e.  W
)  /\  ( x  =  X  /\  z  =  Z ) )  ->  { i  e.  dom  x  |  ( x " { i } )  =/=  { z } }  =  { i  e.  dom  X  | 
( X " {
i } )  =/= 
{ Z } }
)
12 elex 2815 . . 3  |-  ( X  e.  V  ->  X  e.  _V )
1312adantr 276 . 2  |-  ( ( X  e.  V  /\  Z  e.  W )  ->  X  e.  _V )
14 elex 2815 . . 3  |-  ( Z  e.  W  ->  Z  e.  _V )
1514adantl 277 . 2  |-  ( ( X  e.  V  /\  Z  e.  W )  ->  Z  e.  _V )
16 dmexg 5002 . . . 4  |-  ( X  e.  V  ->  dom  X  e.  _V )
1716adantr 276 . . 3  |-  ( ( X  e.  V  /\  Z  e.  W )  ->  dom  X  e.  _V )
18 rabexg 4238 . . 3  |-  ( dom 
X  e.  _V  ->  { i  e.  dom  X  |  ( X " { i } )  =/=  { Z } }  e.  _V )
1917, 18syl 14 . 2  |-  ( ( X  e.  V  /\  Z  e.  W )  ->  { i  e.  dom  X  |  ( X " { i } )  =/=  { Z } }  e.  _V )
202, 11, 13, 15, 19ovmpod 6159 1  |-  ( ( X  e.  V  /\  Z  e.  W )  ->  ( X supp  Z )  =  { i  e. 
dom  X  |  ( X " { i } )  =/=  { Z } } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    =/= wne 2403   {crab 2515   _Vcvv 2803   {csn 3673   dom cdm 4731   "cima 4734  (class class class)co 6028    e. cmpo 6030   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-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-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-supp 6414
This theorem is referenced by:  supp0  6416  suppval1  6417  suppssdmg  6427  suppsnopdc  6428  ressuppss  6432
  Copyright terms: Public domain W3C validator