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

Theorem setsvalg 17084
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 3458 . 2 (𝑆𝑉𝑆 ∈ V)
2 elex 3458 . 2 (𝐴𝑊𝐴 ∈ V)
3 resexg 5983 . . . . 5 (𝑆 ∈ V → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V)
43adantr 480 . . . 4 ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V)
5 snex 5378 . . . 4 {𝐴} ∈ V
6 unexg 7685 . . . 4 (((𝑆 ↾ (V ∖ dom {𝐴})) ∈ V ∧ {𝐴} ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V)
74, 5, 6sylancl 586 . . 3 ((𝑆 ∈ V ∧ 𝐴 ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V)
8 simpl 482 . . . . . 6 ((𝑠 = 𝑆𝑒 = 𝐴) → 𝑠 = 𝑆)
9 simpr 484 . . . . . . . . 9 ((𝑠 = 𝑆𝑒 = 𝐴) → 𝑒 = 𝐴)
109sneqd 4589 . . . . . . . 8 ((𝑠 = 𝑆𝑒 = 𝐴) → {𝑒} = {𝐴})
1110dmeqd 5851 . . . . . . 7 ((𝑠 = 𝑆𝑒 = 𝐴) → dom {𝑒} = dom {𝐴})
1211difeq2d 4075 . . . . . 6 ((𝑠 = 𝑆𝑒 = 𝐴) → (V ∖ dom {𝑒}) = (V ∖ dom {𝐴}))
138, 12reseq12d 5936 . . . . 5 ((𝑠 = 𝑆𝑒 = 𝐴) → (𝑠 ↾ (V ∖ dom {𝑒})) = (𝑆 ↾ (V ∖ dom {𝐴})))
1413, 10uneq12d 4118 . . . 4 ((𝑠 = 𝑆𝑒 = 𝐴) → ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒}) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
15 df-sets 17082 . . . 4 sSet = (𝑠 ∈ V, 𝑒 ∈ V ↦ ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒}))
1614, 15ovmpoga 7509 . . 3 ((𝑆 ∈ V ∧ 𝐴 ∈ V ∧ ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
177, 16mpd3an3 1464 . 2 ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
181, 2, 17syl2an 596 1 ((𝑆𝑉𝐴𝑊) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3437  cdif 3895  cun 3896  {csn 4577  dom cdm 5621  cres 5623  (class class class)co 7355   sSet csts 17081
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7677
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-res 5633  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-sets 17082
This theorem is referenced by:  setsval  17085  setsdm  17088  setsfun  17089  setsfun0  17090  wunsets  17095  setsres  17096
  Copyright terms: Public domain W3C validator