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

Theorem setsidvald 17383
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 6899 . . 3 (𝐸‘𝑆) ∈ V
3 setsval 17351 . . 3 ((𝑆 ∈ 𝑉 ∧ (𝐸‘𝑆) ∈ V) → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
41, 2, 3sylancl 598 . 2 (𝜑 → (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}))
5 setsidvald.e . . . . . 6 𝐸 = Slot 𝑁
65, 1strfvnd 17369 . . . . 5 (𝜑 → (𝐸‘𝑆) = (𝑆‘𝑁))
76opeq2d 4846 . . . 4 (𝜑 → ⟨𝑁, (𝐸‘𝑆)⟩ = ⟨𝑁, (𝑆‘𝑁)⟩)
87sneqd 4592 . . 3 (𝜑 → {⟨𝑁, (𝐸‘𝑆)⟩} = {⟨𝑁, (𝑆‘𝑁)⟩})
98uneq2d 4167 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝐸‘𝑆)⟩}) = ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}))
10 setsidvald.f . . 3 (𝜑 → Fun 𝑆)
11 setsidvald.d . . 3 (𝜑 → 𝑁 ∈ dom 𝑆)
12 funresdfunsn 7195 . . 3 ((Fun 𝑆 ∧ 𝑁 ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
1310, 11, 12syl2anc 596 . 2 (𝜑 → ((𝑆 ↾ (V ∖ {𝑁})) ∪ {⟨𝑁, (𝑆‘𝑁)⟩}) = 𝑆)
144, 9, 133eqtrrd 2800 1 (𝜑 → 𝑆 = (𝑆 sSet ⟨𝑁, (𝐸‘𝑆)⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4045   ∪ cun 4149  {csn 4584  ⟨cop 4834  dom cdm 5650   ↾ cres 5652  Fun wfun 6533  ‘cfv 6539  (class class class)co 7421   sSet csts 17347  Slot cslot 17365
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-sets 17348  df-slot 17366
This theorem is used by:  ressval3d  17430  opprabs  34053
  Copyright terms: Public domain W3C validator