Theorem resmptf 5113

Description: Restriction of the mapping operation. (Contributed by Thierry Arnoux, 28-Mar-2017.)

Hypotheses

Ref	Expression
resmptf.a	|- F/_ x A
resmptf.b	|- F/_ x B

Assertion

Ref	Expression
resmptf	|- ( B C_ A -> ( ( x e. A |-> C ) |` B ) = ( x e. B |-> C ) )

Proof of Theorem resmptf

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		resmpt 5111	. 2 |- ( B C_ A -> ( ( y e. A |-> [_ y / x ]_ C ) |` B ) = ( y e. B |-> [_ y / x ]_ C ) )
2		resmptf.a	. . . 4 |- F/_ x A
3		nfcv 2392	. . . 4 |- F/_ y A
4		nfcv 2392	. . . 4 |- F/_ y C
5		nfcsb1v 3180	. . . 4 |- F/_ x [_ y / x ]_ C
6		csbeq1a 3156	. . . 4 |- ( x = y -> C = [_ y / x ]_ C )
7	2, 3, 4, 5, 6	cbvmptf 4225	. . 3 |- ( x e. A |-> C ) = ( y e. A |-> [_ y / x ]_ C )
8	7	reseq1i 5059	. 2 |- ( ( x e. A |-> C ) |` B ) = ( ( y e. A |-> [_ y / x ]_ C ) |` B )
9		resmptf.b	. . 3 |- F/_ x B
10		nfcv 2392	. . 3 |- F/_ y B
11	9, 10, 4, 5, 6	cbvmptf 4225	. 2 |- ( x e. B |-> C ) = ( y e. B |-> [_ y / x ]_ C )
12	1, 8, 11	3eqtr4g 2296	1 |- ( B C_ A -> ( ( x e. A |-> C ) |` B ) = ( x e. B |-> C ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   F/_wnfc 2379   [_csb 3147   C_ wss 3220   |-> cmpt 4192   |` cres 4776

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-opab 4193  df-mpt 4194  df-xp 4780  df-rel 4781  df-res 4786

This theorem is used by: (None)