Theorem fvsnun2 6922

Description: The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 6921. (Contributed by NM, 23-Sep-2007.) Put in deduction form. (Revised by BJ, 25-Feb-2023.)

Hypotheses

Ref	Expression
fvsnun.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
fvsnun.2	⊢ (𝜑 → 𝐵 ∈ 𝑊)
fvsnun.3	⊢ 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
fvsnun2.4	⊢ (𝜑 → 𝐷 ∈ (𝐶 ∖ {𝐴}))

Assertion

Ref	Expression
fvsnun2	⊢ (𝜑 → (𝐺‘𝐷) = (𝐹‘𝐷))

Proof of Theorem fvsnun2

Step	Hyp	Ref	Expression
1		fvsnun.3	. . . . . 6 ⊢ 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
2	1	reseq1i 5814	. . . . 5 ⊢ (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴}))
3	2	a1i 11	. . . 4 ⊢ (𝜑 → (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})))
4		resundir 5833	. . . . 5 ⊢ (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})))
5	4	a1i 11	. . . 4 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))))
6		disjdif 4379	. . . . . . 7 ⊢ ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅
7		fvsnun.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
8		fvsnun.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
9		fnsng 6376	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {⟨𝐴, 𝐵⟩} Fn {𝐴})
10	7, 8, 9	syl2anc 587	. . . . . . . 8 ⊢ (𝜑 → {⟨𝐴, 𝐵⟩} Fn {𝐴})
11		fnresdisj 6439	. . . . . . . 8 ⊢ ({⟨𝐴, 𝐵⟩} Fn {𝐴} → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅))
12	10, 11	syl 17	. . . . . . 7 ⊢ (𝜑 → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅))
13	6, 12	mpbii 236	. . . . . 6 ⊢ (𝜑 → ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅)
14		residm 5851	. . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
15	14	a1i 11	. . . . . 6 ⊢ (𝜑 → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
16	13, 15	uneq12d 4091	. . . . 5 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))))
17		uncom 4080	. . . . . 6 ⊢ (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅)
18	17	a1i 11	. . . . 5 ⊢ (𝜑 → (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅))
19		un0 4298	. . . . . 6 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
20	19	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
21	16, 18, 20	3eqtrd 2837	. . . 4 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
22	3, 5, 21	3eqtrd 2837	. . 3 ⊢ (𝜑 → (𝐺 ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
23	22	fveq1d 6647	. 2 ⊢ (𝜑 → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷))
24		fvsnun2.4	. . 3 ⊢ (𝜑 → 𝐷 ∈ (𝐶 ∖ {𝐴}))
25	24	fvresd 6665	. 2 ⊢ (𝜑 → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐺‘𝐷))
26	24	fvresd 6665	. 2 ⊢ (𝜑 → ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐹‘𝐷))
27	23, 25, 26	3eqtr3d 2841	1 ⊢ (𝜑 → (𝐺‘𝐷) = (𝐹‘𝐷))

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111   ∖ cdif 3878   ∪ cun 3879   ∩ cin 3880  ∅c0 4243  {csn 4525  ⟨cop 4531   ↾ cres 5521   Fn wfn 6319  ‘cfv 6324

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-res 5531  df-iota 6283  df-fun 6326  df-fn 6327  df-fv 6332

This theorem is referenced by:  facnn  13631  satfv1lem  32722