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

Theorem setsidvald 17370
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 6896 . . 3 (𝐸‘𝑆) ∈ V
3 setsval 17338 . . 3 ((𝑆 ∈ 𝑉 ∧ (𝐸‘𝑆) ∈ V) → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
41, 2, 3sylancl 598 . 2 (𝜑 → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
5 setsidvald.e . . . . . 6 𝐸 = Slot 𝑁
65, 1strfvnd 17356 . . . . 5 (𝜑 → (𝐸‘𝑆) = (𝑆‘𝑁))
76opeq2d 4840 . . . 4 (𝜑 → ⟨𝑁, (𝐸‘𝑆)⟩ = ⟨𝑁, (𝑆‘𝑁)⟩)
87sneqd 4596 . . 3 (𝜑 → {⟨𝑁, (𝐸‘𝑆)⟩} = {⟨𝑁, (𝑆‘𝑁)⟩})
98uneq2d 4115 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}))
10 setsidvald.f . . 3 (𝜑 → Fun 𝑆)
11 setsidvald.d . . 3 (𝜑 → 𝑁 ∈ dom 𝑆)
12 funresdfunsn 7192 . . 3 ((Fun 𝑆 ∧ 𝑁 ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
1310, 11, 12syl2anc 596 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
144, 9, 133eqtrrd 2801 1 (𝜑 → 𝑆 = (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897  {csn 4584  ⟨cop 4590  dom cdm 5651   ↾ cres 5653  Fun wfun 6531  ‘cfv 6537  (class class class)co 7418   sSet csts 17334  Slot cslot 17352
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-sets 17335  df-slot 17353
This theorem is used by:  ressval3d  17417  opprabs  33999
  Copyright terms: Public domain W3C validator