Theorem fvsnun1 7138

Description: The value of a function with one of its ordered pairs replaced, at the replaced ordered pair. See also fvsnun2 7139. (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	⊢ 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))

Assertion

Ref	Expression
fvsnun1	⊢ (𝜑 → (𝐺‘𝐴) = 𝐵)

Proof of Theorem fvsnun1

Step	Hyp	Ref	Expression
1		fvsnun.3	. . . . 5 ⊢ 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
2	1	reseq1i 5942	. . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴})
3		resundir 5961	. . . . 5 ⊢ (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}))
4		disjdifr 4427	. . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅
5		resdisj 6135	. . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅)
6	4, 5	ax-mp 5	. . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅
7	6	uneq2i 4119	. . . . . 6 ⊢ (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ∅)
8		un0 4348	. . . . . 6 ⊢ (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ∅) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
9	7, 8	eqtri 2760	. . . . 5 ⊢ (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
10	3, 9	eqtri 2760	. . . 4 ⊢ (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
11	2, 10	eqtri 2760	. . 3 ⊢ (𝐺 ↾ {𝐴}) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
12	11	fveq1i 6843	. 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴)
13		fvsnun.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
14		snidg 4619	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
15	13, 14	syl 17	. . 3 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
16	15	fvresd 6862	. 2 ⊢ (𝜑 → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴))
17	15	fvresd 6862	. . 3 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = ({⟨𝐴, 𝐵⟩}‘𝐴))
18		fvsnun.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
19		fvsng 7136	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({⟨𝐴, 𝐵⟩}‘𝐴) = 𝐵)
20	13, 18, 19	syl2anc 585	. . 3 ⊢ (𝜑 → ({⟨𝐴, 𝐵⟩}‘𝐴) = 𝐵)
21	17, 20	eqtrd 2772	. 2 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = 𝐵)
22	12, 16, 21	3eqtr3a 2796	1 ⊢ (𝜑 → (𝐺‘𝐴) = 𝐵)

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114   ∖ cdif 3900   ∪ cun 3901   ∩ cin 3902  ∅c0 4287  {csn 4582  ⟨cop 4588   ↾ cres 5634  ‘cfv 6500

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-res 5644  df-iota 6456  df-fun 6502  df-fv 6508

This theorem is referenced by:  fac0  14211  ruclem4  16171  satfv1lem  35578