Theorem setsnidOLD 17093

Description: Obsolete proof of setsnid 17092 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

Step	Hyp	Ref	Expression
1		setsid.e	. . . 4 ⊢ 𝐸 = Slot (𝐸‘ndx)
2		id 22	. . . 4 ⊢ (𝑊 ∈ V → 𝑊 ∈ V)
3	1, 2	strfvnd 17068	. . 3 ⊢ (𝑊 ∈ V → (𝐸‘𝑊) = (𝑊‘(𝐸‘ndx)))
4		ovex 7395	. . . . 5 ⊢ (𝑊 sSet ⟨𝐷, 𝐶⟩) ∈ V
5	4, 1	strfvn 17069	. . . 4 ⊢ (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)) = ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx))
6		setsres 17061	. . . . . 6 ⊢ (𝑊 ∈ V → ((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷})) = (𝑊 ↾ (V ∖ {𝐷})))
7	6	fveq1d 6849	. . . . 5 ⊢ (𝑊 ∈ V → (((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = ((𝑊 ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)))
8		fvex 6860	. . . . . . 7 ⊢ (𝐸‘ndx) ∈ V
9		setsnid.n	. . . . . . 7 ⊢ (𝐸‘ndx) ≠ 𝐷
10		eldifsn 4752	. . . . . . 7 ⊢ ((𝐸‘ndx) ∈ (V ∖ {𝐷}) ↔ ((𝐸‘ndx) ∈ V ∧ (𝐸‘ndx) ≠ 𝐷))
11	8, 9, 10	mpbir2an 709	. . . . . 6 ⊢ (𝐸‘ndx) ∈ (V ∖ {𝐷})
12		fvres 6866	. . . . . 6 ⊢ ((𝐸‘ndx) ∈ (V ∖ {𝐷}) → (((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx)))
13	11, 12	ax-mp 5	. . . . 5 ⊢ (((𝑊 sSet ⟨𝐷, 𝐶⟩) ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx))
14		fvres 6866	. . . . . 6 ⊢ ((𝐸‘ndx) ∈ (V ∖ {𝐷}) → ((𝑊 ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = (𝑊‘(𝐸‘ndx)))
15	11, 14	ax-mp 5	. . . . 5 ⊢ ((𝑊 ↾ (V ∖ {𝐷}))‘(𝐸‘ndx)) = (𝑊‘(𝐸‘ndx))
16	7, 13, 15	3eqtr3g 2794	. . . 4 ⊢ (𝑊 ∈ V → ((𝑊 sSet ⟨𝐷, 𝐶⟩)‘(𝐸‘ndx)) = (𝑊‘(𝐸‘ndx)))
17	5, 16	eqtrid 2783	. . 3 ⊢ (𝑊 ∈ V → (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)) = (𝑊‘(𝐸‘ndx)))
18	3, 17	eqtr4d 2774	. 2 ⊢ (𝑊 ∈ V → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)))
19	1	str0 17072	. . 3 ⊢ ∅ = (𝐸‘∅)
20		fvprc 6839	. . 3 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅)
21		reldmsets 17048	. . . . 5 ⊢ Rel dom sSet
22	21	ovprc1 7401	. . . 4 ⊢ (¬ 𝑊 ∈ V → (𝑊 sSet ⟨𝐷, 𝐶⟩) = ∅)
23	22	fveq2d 6851	. . 3 ⊢ (¬ 𝑊 ∈ V → (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)) = (𝐸‘∅))
24	19, 20, 23	3eqtr4a 2797	. 2 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩)))
25	18, 24	pm2.61i 182	1 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet ⟨𝐷, 𝐶⟩))

Syntax hints:  ¬ wn 3   = wceq 1541   ∈ wcel 2106   ≠ wne 2939  Vcvv 3446   ∖ cdif 3910  ∅c0 4287  {csn 4591  ⟨cop 4597   ↾ cres 5640  ‘cfv 6501  (class class class)co 7362   sSet csts 17046  Slot cslot 17064  ndxcnx 17076

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389  ax-un 7677

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-sbc 3743  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-res 5650  df-iota 6453  df-fun 6503  df-fv 6509  df-ov 7365  df-oprab 7366  df-mpo 7367  df-sets 17047  df-slot 17065

This theorem is referenced by: (None)