MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  setsvalg Structured version   Visualization version   GIF version

Theorem setsvalg 16575
Description: Value of the structure replacement function. (Contributed by Mario Carneiro, 30-Apr-2015.)
Assertion
Ref Expression
setsvalg ((𝑆𝑉𝐴𝑊) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))

Proof of Theorem setsvalg
Dummy variables 𝑒 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3428 . 2 (𝑆𝑉𝑆 ∈ V)
2 elex 3428 . 2 (𝐴𝑊𝐴 ∈ V)
3 resexg 5873 . . . . 5 (𝑆 ∈ V → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V)
43adantr 484 . . . 4 ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V)
5 snex 5303 . . . 4 {𝐴} ∈ V
6 unexg 7475 . . . 4 (((𝑆 ↾ (V ∖ dom {𝐴})) ∈ V ∧ {𝐴} ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V)
74, 5, 6sylancl 589 . . 3 ((𝑆 ∈ V ∧ 𝐴 ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V)
8 simpl 486 . . . . . 6 ((𝑠 = 𝑆𝑒 = 𝐴) → 𝑠 = 𝑆)
9 simpr 488 . . . . . . . . 9 ((𝑠 = 𝑆𝑒 = 𝐴) → 𝑒 = 𝐴)
109sneqd 4537 . . . . . . . 8 ((𝑠 = 𝑆𝑒 = 𝐴) → {𝑒} = {𝐴})
1110dmeqd 5750 . . . . . . 7 ((𝑠 = 𝑆𝑒 = 𝐴) → dom {𝑒} = dom {𝐴})
1211difeq2d 4030 . . . . . 6 ((𝑠 = 𝑆𝑒 = 𝐴) → (V ∖ dom {𝑒}) = (V ∖ dom {𝐴}))
138, 12reseq12d 5828 . . . . 5 ((𝑠 = 𝑆𝑒 = 𝐴) → (𝑠 ↾ (V ∖ dom {𝑒})) = (𝑆 ↾ (V ∖ dom {𝐴})))
1413, 10uneq12d 4071 . . . 4 ((𝑠 = 𝑆𝑒 = 𝐴) → ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒}) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
15 df-sets 16553 . . . 4 sSet = (𝑠 ∈ V, 𝑒 ∈ V ↦ ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒}))
1614, 15ovmpoga 7304 . . 3 ((𝑆 ∈ V ∧ 𝐴 ∈ V ∧ ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
177, 16mpd3an3 1459 . 2 ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
181, 2, 17syl2an 598 1 ((𝑆𝑉𝐴𝑊) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2111  Vcvv 3409  cdif 3857  cun 3858  {csn 4525  dom cdm 5527  cres 5529  (class class class)co 7155   sSet csts 16544
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5172  ax-nul 5179  ax-pr 5301  ax-un 7464
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-sbc 3699  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-nul 4228  df-if 4424  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5036  df-opab 5098  df-id 5433  df-xp 5533  df-rel 5534  df-cnv 5535  df-co 5536  df-dm 5537  df-res 5539  df-iota 6298  df-fun 6341  df-fv 6347  df-ov 7158  df-oprab 7159  df-mpo 7160  df-sets 16553
This theorem is referenced by:  setsval  16576  setsdm  16580  setsfun  16581  setsfun0  16582  wunsets  16587  setsres  16588
  Copyright terms: Public domain W3C validator