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

Theorem setsvalg 12435
Description: Value of the structure replacement function. (Contributed by Mario Carneiro, 30-Apr-2015.)
Assertion
Ref Expression
setsvalg  |-  ( ( S  e.  V  /\  A  e.  W )  ->  ( S sSet  A )  =  ( ( S  |`  ( _V  \  dom  { A } ) )  u.  { A }
) )

Proof of Theorem setsvalg
Dummy variables  e  s are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2741 . 2  |-  ( S  e.  V  ->  S  e.  _V )
2 elex 2741 . 2  |-  ( A  e.  W  ->  A  e.  _V )
3 resexg 4929 . . . 4  |-  ( S  e.  _V  ->  ( S  |`  ( _V  \  dom  { A } ) )  e.  _V )
4 snexg 4168 . . . 4  |-  ( A  e.  _V  ->  { A }  e.  _V )
5 unexg 4426 . . . 4  |-  ( ( ( S  |`  ( _V  \  dom  { A } ) )  e. 
_V  /\  { A }  e.  _V )  ->  ( ( S  |`  ( _V  \  dom  { A } ) )  u. 
{ A } )  e.  _V )
63, 4, 5syl2an 287 . . 3  |-  ( ( S  e.  _V  /\  A  e.  _V )  ->  ( ( S  |`  ( _V  \  dom  { A } ) )  u. 
{ A } )  e.  _V )
7 simpl 108 . . . . . 6  |-  ( ( s  =  S  /\  e  =  A )  ->  s  =  S )
8 simpr 109 . . . . . . . . 9  |-  ( ( s  =  S  /\  e  =  A )  ->  e  =  A )
98sneqd 3594 . . . . . . . 8  |-  ( ( s  =  S  /\  e  =  A )  ->  { e }  =  { A } )
109dmeqd 4811 . . . . . . 7  |-  ( ( s  =  S  /\  e  =  A )  ->  dom  { e }  =  dom  { A } )
1110difeq2d 3245 . . . . . 6  |-  ( ( s  =  S  /\  e  =  A )  ->  ( _V  \  dom  { e } )  =  ( _V  \  dom  { A } ) )
127, 11reseq12d 4890 . . . . 5  |-  ( ( s  =  S  /\  e  =  A )  ->  ( s  |`  ( _V  \  dom  { e } ) )  =  ( S  |`  ( _V  \  dom  { A } ) ) )
1312, 9uneq12d 3282 . . . 4  |-  ( ( s  =  S  /\  e  =  A )  ->  ( ( s  |`  ( _V  \  dom  {
e } ) )  u.  { e } )  =  ( ( S  |`  ( _V  \  dom  { A }
) )  u.  { A } ) )
14 df-sets 12412 . . . 4  |- sSet  =  ( s  e.  _V , 
e  e.  _V  |->  ( ( s  |`  ( _V  \  dom  { e } ) )  u. 
{ e } ) )
1513, 14ovmpoga 5980 . . 3  |-  ( ( S  e.  _V  /\  A  e.  _V  /\  (
( S  |`  ( _V  \  dom  { A } ) )  u. 
{ A } )  e.  _V )  -> 
( S sSet  A )  =  ( ( S  |`  ( _V  \  dom  { A } ) )  u.  { A }
) )
166, 15mpd3an3 1333 . 2  |-  ( ( S  e.  _V  /\  A  e.  _V )  ->  ( S sSet  A )  =  ( ( S  |`  ( _V  \  dom  { A } ) )  u.  { A }
) )
171, 2, 16syl2an 287 1  |-  ( ( S  e.  V  /\  A  e.  W )  ->  ( S sSet  A )  =  ( ( S  |`  ( _V  \  dom  { A } ) )  u.  { A }
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1348    e. wcel 2141   _Vcvv 2730    \ cdif 3118    u. cun 3119   {csn 3581   dom cdm 4609    |` cres 4611  (class class class)co 5851   sSet csts 12403
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4105  ax-pow 4158  ax-pr 4192  ax-un 4416  ax-setind 4519
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-id 4276  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-res 4621  df-iota 5158  df-fun 5198  df-fv 5204  df-ov 5854  df-oprab 5855  df-mpo 5856  df-sets 12412
This theorem is referenced by:  setsvala  12436  setsfun  12440  setsfun0  12441  setsresg  12443
  Copyright terms: Public domain W3C validator