Theorem fvsnun2 5756

Description: The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 5755. (Contributed by NM, 23-Sep-2007.)

Hypotheses

Ref	Expression
fvsnun.1	|- A e. _V
fvsnun.2	|- B e. _V
fvsnun.3	|- G = ( { <. A , B >. } u. ( F |` ( C \ { A } ) ) )

Assertion

Ref	Expression
fvsnun2	|- ( D e. ( C \ { A } ) -> ( G ` D ) = ( F ` D ) )

Proof of Theorem fvsnun2

Step	Hyp	Ref	Expression
1		fvsnun.3	. . . . 5 |- G = ( { <. A , B >. } u. ( F |` ( C \ { A } ) ) )
2	1	reseq1i 4938	. . . 4 |- ( G |` ( C \ { A } ) ) = ( ( { <. A , B >. } u. ( F |` ( C \ { A } ) ) ) |` ( C \ { A } ) )
3		resundir 4956	. . . 4 |- ( ( { <. A , B >. } u. ( F |` ( C \ { A } ) ) ) |` ( C \ { A } ) ) = ( ( { <. A , B >. } |` ( C \ { A } ) ) u. ( ( F |` ( C \ { A } ) ) |` ( C \ { A } ) ) )
4		disjdif 3519	. . . . . . 7 |- ( { A } i^i ( C \ { A } ) ) = (/)
5		fvsnun.1	. . . . . . . . 9 |- A e. _V
6		fvsnun.2	. . . . . . . . 9 |- B e. _V
7	5, 6	fnsn 5308	. . . . . . . 8 |- { <. A , B >. } Fn { A }
8		fnresdisj 5364	. . . . . . . 8 |- ( { <. A , B >. } Fn { A } -> ( ( { A } i^i ( C \ { A } ) ) = (/) <-> ( { <. A , B >. } |` ( C \ { A } ) ) = (/) ) )
9	7, 8	ax-mp 5	. . . . . . 7 |- ( ( { A } i^i ( C \ { A } ) ) = (/) <-> ( { <. A , B >. } |` ( C \ { A } ) ) = (/) )
10	4, 9	mpbi 145	. . . . . 6 |- ( { <. A , B >. } |` ( C \ { A } ) ) = (/)
11		residm 4974	. . . . . 6 |- ( ( F |` ( C \ { A } ) ) |` ( C \ { A } ) ) = ( F |` ( C \ { A } ) )
12	10, 11	uneq12i 3311	. . . . 5 |- ( ( { <. A , B >. } |` ( C \ { A } ) ) u. ( ( F |` ( C \ { A } ) ) |` ( C \ { A } ) ) ) = ( (/) u. ( F |` ( C \ { A } ) ) )
13		uncom 3303	. . . . 5 |- ( (/) u. ( F |` ( C \ { A } ) ) ) = ( ( F |` ( C \ { A } ) ) u. (/) )
14		un0 3480	. . . . 5 |- ( ( F |` ( C \ { A } ) ) u. (/) ) = ( F |` ( C \ { A } ) )
15	12, 13, 14	3eqtri 2218	. . . 4 |- ( ( { <. A , B >. } |` ( C \ { A } ) ) u. ( ( F |` ( C \ { A } ) ) |` ( C \ { A } ) ) ) = ( F |` ( C \ { A } ) )
16	2, 3, 15	3eqtri 2218	. . 3 |- ( G |` ( C \ { A } ) ) = ( F |` ( C \ { A } ) )
17	16	fveq1i 5555	. 2 |- ( ( G |` ( C \ { A } ) ) ` D ) = ( ( F |` ( C \ { A } ) ) ` D )
18		fvres 5578	. 2 |- ( D e. ( C \ { A } ) -> ( ( G |` ( C \ { A } ) ) ` D ) = ( G ` D ) )
19		fvres 5578	. 2 |- ( D e. ( C \ { A } ) -> ( ( F |` ( C \ { A } ) ) ` D ) = ( F ` D ) )
20	17, 18, 19	3eqtr3a 2250	1 |- ( D e. ( C \ { A } ) -> ( G ` D ) = ( F ` D ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1364   e. wcel 2164   _Vcvv 2760   \ cdif 3150   u. cun 3151   i^i cin 3152   (/)c0 3446   {csn 3618   <.cop 3621   |` cres 4661   Fn wfn 5249   ` cfv 5254

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262

This theorem is referenced by:  facnn  10798