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

Theorem setsnidOLD 17243
Description: Obsolete version of setsnid 17242 as of 7-Nov-2024. Value of the structure replacement function at an untouched index. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by Mario Carneiro, 30-Apr-2015.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
setsid.e 𝐸 = Slot (𝐸‘ndx)
setsnid.n (𝐸‘ndx) ≠ 𝐷
Assertion
Ref Expression
setsnidOLD (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩))

Proof of Theorem setsnidOLD
StepHypRef Expression
1 setsid.e . . . 4 𝐸 = Slot (𝐸‘ndx)
2 id 22 . . . 4 (𝑊 ∈ V → 𝑊 ∈ V)
31, 2strfvnd 17218 . . 3 (𝑊 ∈ V → (𝐸𝑊) = (𝑊‘(𝐸‘ndx)))
4 ovex 7463 . . . . 5 (𝑊 sSet ⟨𝐷, 𝐶⟩) ∈ V
54, 1strfvn 17219 . . . 4 (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)) = ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx))
6 setsres 17211 . . . . . 6 (𝑊 ∈ V → ((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷})) = (𝑊 ↾ (V ∖ {𝐷})))
76fveq1d 6908 . . . . 5 (𝑊 ∈ V → (((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = ((𝑊 ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)))
8 fvex 6919 . . . . . . 7 (𝐸‘ndx) ∈ V
9 setsnid.n . . . . . . 7 (𝐸‘ndx) ≠ 𝐷
10 eldifsn 4790 . . . . . . 7 ((𝐸‘ndx) ∈ (V ∖ {𝐷}) ↔ ((𝐸‘ndx) ∈ V ∧ (𝐸‘ndx) ≠ 𝐷))
118, 9, 10mpbir2an 711 . . . . . 6 (𝐸‘ndx) ∈ (V ∖ {𝐷})
12 fvres 6925 . . . . . 6 ((𝐸‘ndx) ∈ (V ∖ {𝐷}) → (((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx)))
1311, 12ax-mp 5 . . . . 5 (((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx))
14 fvres 6925 . . . . . 6 ((𝐸‘ndx) ∈ (V ∖ {𝐷}) → ((𝑊 ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = (𝑊‘(𝐸‘ndx)))
1511, 14ax-mp 5 . . . . 5 ((𝑊 ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = (𝑊‘(𝐸‘ndx))
167, 13, 153eqtr3g 2797 . . . 4 (𝑊 ∈ V → ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx)) = (𝑊‘(𝐸‘ndx)))
175, 16eqtrid 2786 . . 3 (𝑊 ∈ V → (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)) = (𝑊‘(𝐸‘ndx)))
183, 17eqtr4d 2777 . 2 (𝑊 ∈ V → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)))
191str0 17222 . . 3 ∅ = (𝐸‘∅)
20 fvprc 6898 . . 3 𝑊 ∈ V → (𝐸𝑊) = ∅)
21 reldmsets 17198 . . . . 5 Rel dom sSet
2221ovprc1 7469 . . . 4 𝑊 ∈ V → (𝑊 sSet ⟨𝐷, 𝐶⟩) = ∅)
2322fveq2d 6910 . . 3 𝑊 ∈ V → (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)) = (𝐸‘∅))
2419, 20, 233eqtr4a 2800 . 2 𝑊 ∈ V → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)))
2518, 24pm2.61i 182 1 (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1536  wcel 2105  wne 2937  Vcvv 3477  cdif 3959  c0 4338  {csn 4630  cop 4636  cres 5690  cfv 6562  (class class class)co 7430   sSet csts 17196  Slot cslot 17214  ndxcnx 17226
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437  ax-un 7753
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-sbc 3791  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-res 5700  df-iota 6515  df-fun 6564  df-fv 6570  df-ov 7433  df-oprab 7434  df-mpo 7435  df-sets 17197  df-slot 17215
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator