Theorem fliftfuns 5750

Description: The function F is the unique function defined by F ` A = B, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.)

Hypotheses

Ref	Expression
flift.1	|- F = ran ( x e. X |-> <. A , B >. )
flift.2	|- ( ( ph /\ x e. X ) -> A e. R )
flift.3	|- ( ( ph /\ x e. X ) -> B e. S )

Assertion

Ref	Expression
fliftfuns	|- ( ph -> ( Fun F <-> A. y e. X A. z e. X ( [_ y / x ]_ A = [_ z / x ]_ A -> [_ y / x ]_ B = [_ z / x ]_ B ) ) )

Distinct variable groups:   y, z, A   y, B, z   x, z, y, R   y, F, z   ph, x, y, z   x, X, y, z   x, S, y, z

Allowed substitution hints:   A( x)   B( x)   F( x)

Proof of Theorem fliftfuns

Step	Hyp	Ref	Expression
1		flift.1	. . 3 |- F = ran ( x e. X |-> <. A , B >. )
2		nfcv 2299	. . . . 5 |- F/_ y <. A , B >.
3		nfcsb1v 3064	. . . . . 6 |- F/_ x [_ y / x ]_ A
4		nfcsb1v 3064	. . . . . 6 |- F/_ x [_ y / x ]_ B
5	3, 4	nfop 3759	. . . . 5 |- F/_ x <. [_ y / x ]_ A , [_ y / x ]_ B >.
6		csbeq1a 3040	. . . . . 6 |- ( x = y -> A = [_ y / x ]_ A )
7		csbeq1a 3040	. . . . . 6 |- ( x = y -> B = [_ y / x ]_ B )
8	6, 7	opeq12d 3751	. . . . 5 |- ( x = y -> <. A , B >. = <. [_ y / x ]_ A , [_ y / x ]_ B >. )
9	2, 5, 8	cbvmpt 4061	. . . 4 |- ( x e. X |-> <. A , B >. ) = ( y e. X |-> <. [_ y / x ]_ A , [_ y / x ]_ B >. )
10	9	rneqi 4816	. . 3 |- ran ( x e. X |-> <. A , B >. ) = ran ( y e. X |-> <. [_ y / x ]_ A , [_ y / x ]_ B >. )
11	1, 10	eqtri 2178	. 2 |- F = ran ( y e. X |-> <. [_ y / x ]_ A , [_ y / x ]_ B >. )
12		flift.2	. . . 4 |- ( ( ph /\ x e. X ) -> A e. R )
13	12	ralrimiva 2530	. . 3 |- ( ph -> A. x e. X A e. R )
14	3	nfel1 2310	. . . 4 |- F/ x [_ y / x ]_ A e. R
15	6	eleq1d 2226	. . . 4 |- ( x = y -> ( A e. R <-> [_ y / x ]_ A e. R ) )
16	14, 15	rspc 2810	. . 3 |- ( y e. X -> ( A. x e. X A e. R -> [_ y / x ]_ A e. R ) )
17	13, 16	mpan9 279	. 2 |- ( ( ph /\ y e. X ) -> [_ y / x ]_ A e. R )
18		flift.3	. . . 4 |- ( ( ph /\ x e. X ) -> B e. S )
19	18	ralrimiva 2530	. . 3 |- ( ph -> A. x e. X B e. S )
20	4	nfel1 2310	. . . 4 |- F/ x [_ y / x ]_ B e. S
21	7	eleq1d 2226	. . . 4 |- ( x = y -> ( B e. S <-> [_ y / x ]_ B e. S ) )
22	20, 21	rspc 2810	. . 3 |- ( y e. X -> ( A. x e. X B e. S -> [_ y / x ]_ B e. S ) )
23	19, 22	mpan9 279	. 2 |- ( ( ph /\ y e. X ) -> [_ y / x ]_ B e. S )
24		csbeq1 3034	. 2 |- ( y = z -> [_ y / x ]_ A = [_ z / x ]_ A )
25		csbeq1 3034	. 2 |- ( y = z -> [_ y / x ]_ B = [_ z / x ]_ B )
26	11, 17, 23, 24, 25	fliftfun 5748	1 |- ( ph -> ( Fun F <-> A. y e. X A. z e. X ( [_ y / x ]_ A = [_ z / x ]_ A -> [_ y / x ]_ B = [_ z / x ]_ B ) ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1335   e. wcel 2128   A.wral 2435   [_csb 3031   <.cop 3564   |-> cmpt 4027   ran crn 4589   Fun wfun 5166

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-14 2131  ax-ext 2139  ax-sep 4084  ax-pow 4137  ax-pr 4171

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-un 3106  df-in 3108  df-ss 3115  df-pw 3546  df-sn 3567  df-pr 3568  df-op 3570  df-uni 3775  df-br 3968  df-opab 4028  df-mpt 4029  df-id 4255  df-xp 4594  df-rel 4595  df-cnv 4596  df-co 4597  df-dm 4598  df-rn 4599  df-res 4600  df-ima 4601  df-iota 5137  df-fun 5174  df-fn 5175  df-f 5176  df-fv 5180

This theorem is referenced by: (None)