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

Theorem setsidvald 17276
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 6898 . . 3 (𝐸𝑆) ∈ V
3 setsval 17244 . . 3 ((𝑆𝑉 ∧ (𝐸𝑆) ∈ V) → (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸𝑆)⟩}))
41, 2, 3sylancl 598 . 2 (𝜑 → (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸𝑆)⟩}))
5 setsidvald.e . . . . . 6 𝐸 = Slot 𝑁
65, 1strfvnd 17262 . . . . 5 (𝜑 → (𝐸𝑆) = (𝑆𝑁))
76opeq2d 4847 . . . 4 (𝜑 → ⟨𝑁, (𝐸𝑆)⟩ = ⟨𝑁, (𝑆𝑁)⟩)
87sneqd 4603 . . 3 (𝜑 → {⟨𝑁, (𝐸𝑆)⟩} = {⟨𝑁, (𝑆𝑁)⟩})
98uneq2d 4122 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸𝑆)⟩}) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆𝑁)⟩}))
10 setsidvald.f . . 3 (𝜑 → Fun 𝑆)
11 setsidvald.d . . 3 (𝜑𝑁 ∈ dom 𝑆)
12 funresdfunsn 7191 . . 3 ((Fun 𝑆𝑁 ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆𝑁)⟩}) = 𝑆)
1310, 11, 12syl2anc 596 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆𝑁)⟩}) = 𝑆)
144, 9, 133eqtrrd 2805 1 (𝜑𝑆 = (𝑆 sSet ⟨𝑁, (𝐸𝑆)⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  Vcvv 3457  cdif 3903  cun 3904  {csn 4591  cop 4597  dom cdm 5663  cres 5665  Fun wfun 6534  cfv 6540  (class class class)co 7416   sSet csts 17240  Slot cslot 17258
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-sets 17241  df-slot 17259
This theorem is used by:  ressval3d  17323  opprabs  33787
  Copyright terms: Public domain W3C validator