Theorem fliftf 5700

Description: The domain and range of the function F. (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
fliftf	|- ( ph -> ( Fun F <-> F : ran ( x e. X |-> A ) --> S ) )

Distinct variable groups:   x, R   ph, x   x, X   x, S

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

Proof of Theorem fliftf

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 109	. . . . 5 |- ( ( ph /\ Fun F ) -> Fun F )
2		flift.1	. . . . . . . . . . 11 |- F = ran ( x e. X |-> <. A , B >. )
3		flift.2	. . . . . . . . . . 11 |- ( ( ph /\ x e. X ) -> A e. R )
4		flift.3	. . . . . . . . . . 11 |- ( ( ph /\ x e. X ) -> B e. S )
5	2, 3, 4	fliftel 5694	. . . . . . . . . 10 |- ( ph -> ( y F z <-> E. x e. X ( y = A /\ z = B ) ) )
6	5	exbidv 1797	. . . . . . . . 9 |- ( ph -> ( E. z y F z <-> E. z E. x e. X ( y = A /\ z = B ) ) )
7	6	adantr 274	. . . . . . . 8 |- ( ( ph /\ Fun F ) -> ( E. z y F z <-> E. z E. x e. X ( y = A /\ z = B ) ) )
8		rexcom4 2709	. . . . . . . . 9 |- ( E. x e. X E. z ( y = A /\ z = B ) <-> E. z E. x e. X ( y = A /\ z = B ) )
9		elisset 2700	. . . . . . . . . . . . . 14 |- ( B e. S -> E. z z = B )
10	4, 9	syl 14	. . . . . . . . . . . . 13 |- ( ( ph /\ x e. X ) -> E. z z = B )
11	10	biantrud 302	. . . . . . . . . . . 12 |- ( ( ph /\ x e. X ) -> ( y = A <-> ( y = A /\ E. z z = B ) ) )
12		19.42v 1878	. . . . . . . . . . . 12 |- ( E. z ( y = A /\ z = B ) <-> ( y = A /\ E. z z = B ) )
13	11, 12	syl6rbbr 198	. . . . . . . . . . 11 |- ( ( ph /\ x e. X ) -> ( E. z ( y = A /\ z = B ) <-> y = A ) )
14	13	rexbidva 2434	. . . . . . . . . 10 |- ( ph -> ( E. x e. X E. z ( y = A /\ z = B ) <-> E. x e. X y = A ) )
15	14	adantr 274	. . . . . . . . 9 |- ( ( ph /\ Fun F ) -> ( E. x e. X E. z ( y = A /\ z = B ) <-> E. x e. X y = A ) )
16	8, 15	syl5bbr 193	. . . . . . . 8 |- ( ( ph /\ Fun F ) -> ( E. z E. x e. X ( y = A /\ z = B ) <-> E. x e. X y = A ) )
17	7, 16	bitrd 187	. . . . . . 7 |- ( ( ph /\ Fun F ) -> ( E. z y F z <-> E. x e. X y = A ) )
18	17	abbidv 2257	. . . . . 6 |- ( ( ph /\ Fun F ) -> { y | E. z y F z } = { y | E. x e. X y = A } )
19		df-dm 4549	. . . . . 6 |- dom F = { y | E. z y F z }
20		eqid 2139	. . . . . . 7 |- ( x e. X |-> A ) = ( x e. X |-> A )
21	20	rnmpt 4787	. . . . . 6 |- ran ( x e. X |-> A ) = { y | E. x e. X y = A }
22	18, 19, 21	3eqtr4g 2197	. . . . 5 |- ( ( ph /\ Fun F ) -> dom F = ran ( x e. X |-> A ) )
23		df-fn 5126	. . . . 5 |- ( F Fn ran ( x e. X |-> A ) <-> ( Fun F /\ dom F = ran ( x e. X |-> A ) ) )
24	1, 22, 23	sylanbrc 413	. . . 4 |- ( ( ph /\ Fun F ) -> F Fn ran ( x e. X |-> A ) )
25	2, 3, 4	fliftrel 5693	. . . . . . 7 |- ( ph -> F C_ ( R X. S ) )
26	25	adantr 274	. . . . . 6 |- ( ( ph /\ Fun F ) -> F C_ ( R X. S ) )
27		rnss 4769	. . . . . 6 |- ( F C_ ( R X. S ) -> ran F C_ ran ( R X. S ) )
28	26, 27	syl 14	. . . . 5 |- ( ( ph /\ Fun F ) -> ran F C_ ran ( R X. S ) )
29		rnxpss 4970	. . . . 5 |- ran ( R X. S ) C_ S
30	28, 29	sstrdi 3109	. . . 4 |- ( ( ph /\ Fun F ) -> ran F C_ S )
31		df-f 5127	. . . 4 |- ( F : ran ( x e. X |-> A ) --> S <-> ( F Fn ran ( x e. X |-> A ) /\ ran F C_ S ) )
32	24, 30, 31	sylanbrc 413	. . 3 |- ( ( ph /\ Fun F ) -> F : ran ( x e. X |-> A ) --> S )
33	32	ex 114	. 2 |- ( ph -> ( Fun F -> F : ran ( x e. X |-> A ) --> S ) )
34		ffun 5275	. 2 |- ( F : ran ( x e. X |-> A ) --> S -> Fun F )
35	33, 34	impbid1 141	1 |- ( ph -> ( Fun F <-> F : ran ( x e. X |-> A ) --> S ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1331   E.wex 1468   e. wcel 1480   {cab 2125   E.wrex 2417   C_ wss 3071   <.cop 3530   class class class wbr 3929   |-> cmpt 3989   X. cxp 4537   dom cdm 4539   ran crn 4540   Fun wfun 5117   Fn wfn 5118   -->wf 5119

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131

This theorem is referenced by:  qliftf  6514