Theorem fmptap 6436

Description: Append an additional value to a function. (Contributed by NM, 6-Jun-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)

Hypotheses

Ref	Expression
fmptap.0a	|- A e. _V
fmptap.0b	|- B e. _V
fmptap.1	|- ( R u. { A } ) = S
fmptap.2	|- ( x = A -> C = B )

Assertion

Ref	Expression
fmptap	|- ( ( x e. R |-> C ) u. { <. A , B >. } ) = ( x e. S |-> C )

Distinct variable groups:   x, A   x, B   x, R   x, S

Allowed substitution hint:   C( x)

Proof of Theorem fmptap

Step	Hyp	Ref	Expression
1		fmptap.0a	. . . . 5 |- A e. _V
2		fmptap.0b	. . . . 5 |- B e. _V
3		fmptsn 6433	. . . . 5 |- ( ( A e. _V /\ B e. _V ) -> { <. A , B >. } = ( x e. { A } |-> B ) )
4	1, 2, 3	mp2an 708	. . . 4 |- { <. A , B >. } = ( x e. { A } |-> B )
5		elsni 4194	. . . . . 6 |- ( x e. { A } -> x = A )
6		fmptap.2	. . . . . 6 |- ( x = A -> C = B )
7	5, 6	syl 17	. . . . 5 |- ( x e. { A } -> C = B )
8	7	mpteq2ia 4740	. . . 4 |- ( x e. { A } |-> C ) = ( x e. { A } |-> B )
9	4, 8	eqtr4i 2647	. . 3 |- { <. A , B >. } = ( x e. { A } |-> C )
10	9	uneq2i 3764	. 2 |- ( ( x e. R |-> C ) u. { <. A , B >. } ) = ( ( x e. R |-> C ) u. ( x e. { A } |-> C ) )
11		mptun 6025	. 2 |- ( x e. ( R u. { A } ) |-> C ) = ( ( x e. R |-> C ) u. ( x e. { A } |-> C ) )
12		fmptap.1	. . 3 |- ( R u. { A } ) = S
13		mpteq1 4737	. . 3 |- ( ( R u. { A } ) = S -> ( x e. ( R u. { A } ) |-> C ) = ( x e. S |-> C ) )
14	12, 13	ax-mp 5	. 2 |- ( x e. ( R u. { A } ) |-> C ) = ( x e. S |-> C )
15	10, 11, 14	3eqtr2i 2650	1 |- ( ( x e. R |-> C ) u. { <. A , B >. } ) = ( x e. S |-> C )

Syntax hints:   -> wi 4   = wceq 1483   e. wcel 1990   _Vcvv 3200   u. cun 3572   {csn 4177   <.cop 4183   |-> cmpt 4729

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895

This theorem is referenced by: (None)