Theorem setsidvald 17249

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 6884	. . 3 ⊢ (𝐸‘𝑆) ∈ V
3		setsval 17217	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝐸‘𝑆) ∈ V) → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
4	1, 2, 3	sylancl 597	. 2 ⊢ (𝜑 → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
5		setsidvald.e	. . . . . 6 ⊢ 𝐸 = Slot 𝑁
6	5, 1	strfvnd 17235	. . . . 5 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘𝑁))
7	6	opeq2d 4841	. . . 4 ⊢ (𝜑 → ⟨𝑁, (𝐸‘𝑆)⟩ = ⟨𝑁, (𝑆‘𝑁)⟩)
8	7	sneqd 4597	. . 3 ⊢ (𝜑 → {⟨𝑁, (𝐸‘𝑆)⟩} = {⟨𝑁, (𝑆‘𝑁)⟩})
9	8	uneq2d 4124	. 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}))
10		setsidvald.f	. . 3 ⊢ (𝜑 → Fun 𝑆)
11		setsidvald.d	. . 3 ⊢ (𝜑 → 𝑁 ∈ dom 𝑆)
12		funresdfunsn 7177	. . 3 ⊢ ((Fun 𝑆 ∧ 𝑁 ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
13	10, 11, 12	syl2anc 595	. 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
14	4, 9, 13	3eqtrrd 2805	1 ⊢ (𝜑 → 𝑆 = (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩))

Syntax hints:   → wi 4   = wceq 1563   ∈ wcel 2145  Vcvv 3457   ∖ cdif 3904   ∪ cun 3905  {csn 4585  ⟨cop 4591  dom cdm 5652   ↾ cres 5654  Fun wfun 6519  ‘cfv 6525  (class class class)co 7400   sSet csts 17213  Slot cslot 17231

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-sets 17214  df-slot 17232

This theorem is referenced by:  ressval3d  17296  opprabs  33681