Theorem fvsnun1 7216

Description: The value of a function with one of its ordered pairs replaced, at the replaced ordered pair. See also fvsnun2 7217. (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 6005	. . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴})
3		resundir 6024	. . . . 5 ⊢ (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}))
4		disjdifr 4496	. . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅
5		resdisj 6200	. . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅)
6	4, 5	ax-mp 5	. . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅
7	6	uneq2i 4188	. . . . . 6 ⊢ (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ∅)
8		un0 4417	. . . . . 6 ⊢ (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ∅) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
9	7, 8	eqtri 2768	. . . . 5 ⊢ (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
10	3, 9	eqtri 2768	. . . 4 ⊢ (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
11	2, 10	eqtri 2768	. . 3 ⊢ (𝐺 ↾ {𝐴}) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
12	11	fveq1i 6921	. 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴)
13		fvsnun.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
14		snidg 4682	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
15	13, 14	syl 17	. . 3 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
16	15	fvresd 6940	. 2 ⊢ (𝜑 → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴))
17	15	fvresd 6940	. . 3 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = ({⟨𝐴, 𝐵⟩}‘𝐴))
18		fvsnun.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
19		fvsng 7214	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({⟨𝐴, 𝐵⟩}‘𝐴) = 𝐵)
20	13, 18, 19	syl2anc 583	. . 3 ⊢ (𝜑 → ({⟨𝐴, 𝐵⟩}‘𝐴) = 𝐵)
21	17, 20	eqtrd 2780	. 2 ⊢ (𝜑 → (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = 𝐵)
22	12, 16, 21	3eqtr3a 2804	1 ⊢ (𝜑 → (𝐺‘𝐴) = 𝐵)

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108   ∖ cdif 3973   ∪ cun 3974   ∩ cin 3975  ∅c0 4352  {csn 4648  ⟨cop 4654   ↾ cres 5702  ‘cfv 6573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-res 5712  df-iota 6525  df-fun 6575  df-fv 6581

This theorem is referenced by:  fac0  14325  ruclem4  16282  satfv1lem  35330