Theorem setsidvald 17112

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

Step	Hyp	Ref	Expression
1		setsidvald.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
2		fvex 6841	. . 3 ⊢ (𝐸‘𝑆) ∈ V
3		setsval 17080	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝐸‘𝑆) ∈ V) → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
4	1, 2, 3	sylancl 586	. 2 ⊢ (𝜑 → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
5		setsidvald.e	. . . . . 6 ⊢ 𝐸 = Slot 𝑁
6	5, 1	strfvnd 17098	. . . . 5 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘𝑁))
7	6	opeq2d 4831	. . . 4 ⊢ (𝜑 → ⟨𝑁, (𝐸‘𝑆)⟩ = ⟨𝑁, (𝑆‘𝑁)⟩)
8	7	sneqd 4587	. . 3 ⊢ (𝜑 → {⟨𝑁, (𝐸‘𝑆)⟩} = {⟨𝑁, (𝑆‘𝑁)⟩})
9	8	uneq2d 4117	. 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}))
10		setsidvald.f	. . 3 ⊢ (𝜑 → Fun 𝑆)
11		setsidvald.d	. . 3 ⊢ (𝜑 → 𝑁 ∈ dom 𝑆)
12		funresdfunsn 7129	. . 3 ⊢ ((Fun 𝑆 ∧ 𝑁 ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
13	10, 11, 12	syl2anc 584	. 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
14	4, 9, 13	3eqtrrd 2773	1 ⊢ (𝜑 → 𝑆 = (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩))

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  Vcvv 3437   ∖ cdif 3895   ∪ cun 3896  {csn 4575  ⟨cop 4581  dom cdm 5619   ↾ cres 5621  Fun wfun 6480  ‘cfv 6486  (class class class)co 7352   sSet csts 17076  Slot cslot 17094

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 5236  ax-nul 5246  ax-pr 5372  ax-un 7674

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-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  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 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-sets 17077  df-slot 17095

This theorem is referenced by:  ressval3d  17159  opprabs  33454