Theorem fvsnun2 7195

Description: The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 7194. (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 5970	. . . . 5 ⊢ (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴}))
3	2	a1i 11	. . . 4 ⊢ (𝜑 → (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})))
4		resundir 5989	. . . . 5 ⊢ (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})))
5	4	a1i 11	. . . 4 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))))
6		disjdif 4428	. . . . . . 7 ⊢ ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅
7		fvsnun.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
8		fvsnun.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
9		fnsng 6600	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {⟨𝐴, 𝐵⟩} Fn {𝐴})
10	7, 8, 9	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → {⟨𝐴, 𝐵⟩} Fn {𝐴})
11		fnresdisj 6667	. . . . . . . 8 ⊢ ({⟨𝐴, 𝐵⟩} Fn {𝐴} → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅))
12	10, 11	syl 18	. . . . . . 7 ⊢ (𝜑 → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅))
13	6, 12	mpbii 236	. . . . . 6 ⊢ (𝜑 → ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅)
14		residm 6006	. . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
15	14	a1i 11	. . . . . 6 ⊢ (𝜑 → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
16	13, 15	uneq12d 4170	. . . . 5 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))))
17		uncom 4159	. . . . . 6 ⊢ (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅)
18	17	a1i 11	. . . . 5 ⊢ (𝜑 → (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅))
19		un0 4346	. . . . . 6 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
20	19	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
21	16, 18, 20	3eqtrd 2802	. . . 4 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
22	3, 5, 21	3eqtrd 2802	. . 3 ⊢ (𝜑 → (𝐺 ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴})))
23	22	fveq1d 6895	. 2 ⊢ (𝜑 → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷))
24		fvsnun2.4	. . 3 ⊢ (𝜑 → 𝐷 ∈ (𝐶 ∖ {𝐴}))
25	24	fvresd 6913	. 2 ⊢ (𝜑 → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐺‘𝐷))
26	24	fvresd 6913	. 2 ⊢ (𝜑 → ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐹‘𝐷))
27	23, 25, 26	3eqtr3d 2806	1 ⊢ (𝜑 → (𝐺‘𝐷) = (𝐹‘𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2146   ∖ cdif 4047   ∩ cin 4091   ∪ cun 4151  ∅c0 4280  {csn 4587  ⟨cop 4837   ↾ cres 5656   Fn wfn 6541  ‘cfv 6546

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

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-sb 2101  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-res 5666  df-iota 6500  df-fun 6548  df-fn 6549  df-fv 6554

This theorem is used by:  facnn  14429  satfv1lem  36248