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

Theorem setsidvald 17126
Description: Value of the structure replacement function, deduction version.

Hint: Do not substitute 𝑁 by a specific (positive) integer to be independent of a hard-coded index value. Often, (𝐸‘ndx) can be used instead of 𝑁. (Contributed by AV, 14-Mar-2020.) (Revised by AV, 17-Oct-2024.)

Hypotheses
Ref Expression
setsidvald.e 𝐸 = Slot 𝑁
setsidvald.s (𝜑𝑆𝑉)
setsidvald.f (𝜑 → Fun 𝑆)
setsidvald.d (𝜑𝑁 ∈ dom 𝑆)
Assertion
Ref Expression
setsidvald (𝜑𝑆 = (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩))

Proof of Theorem setsidvald
StepHypRef Expression
1 setsidvald.s . . 3 (𝜑𝑆𝑉)
2 fvex 6847 . . 3 (𝐸𝑆) ∈ V
3 setsval 17094 . . 3 ((𝑆𝑉 ∧ (𝐸𝑆) ∈ V) → (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸𝑆)⟩}))
41, 2, 3sylancl 586 . 2 (𝜑 → (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸𝑆)⟩}))
5 setsidvald.e . . . . . 6 𝐸 = Slot 𝑁
65, 1strfvnd 17112 . . . . 5 (𝜑 → (𝐸𝑆) = (𝑆𝑁))
76opeq2d 4836 . . . 4 (𝜑 → ⟨𝑁, (𝐸𝑆)⟩ = ⟨𝑁, (𝑆𝑁)⟩)
87sneqd 4592 . . 3 (𝜑 → {⟨𝑁, (𝐸𝑆)⟩} = {⟨𝑁, (𝑆𝑁)⟩})
98uneq2d 4120 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸𝑆)⟩}) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆𝑁)⟩}))
10 setsidvald.f . . 3 (𝜑 → Fun 𝑆)
11 setsidvald.d . . 3 (𝜑𝑁 ∈ dom 𝑆)
12 funresdfunsn 7135 . . 3 ((Fun 𝑆𝑁 ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆𝑁)⟩}) = 𝑆)
1310, 11, 12syl2anc 584 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆𝑁)⟩}) = 𝑆)
144, 9, 133eqtrrd 2776 1 (𝜑𝑆 = (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  Vcvv 3440  cdif 3898  cun 3899  {csn 4580  cop 4586  dom cdm 5624  cres 5626  Fun wfun 6486  cfv 6492  (class class class)co 7358   sSet csts 17090  Slot cslot 17108
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 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-sets 17091  df-slot 17109
This theorem is referenced by:  ressval3d  17173  opprabs  33563
  Copyright terms: Public domain W3C validator