Theorem fliftel 5989

Description: Elementhood in the relation 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
fliftel	|- ( ph -> ( C F D <-> E. x e. X ( C = A /\ D = B ) ) )

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

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

Proof of Theorem fliftel

Step	Hyp	Ref	Expression
1		df-br 4126	. . . 4 |- ( C F D <-> <. C , D >. e. F )
2		flift.1	. . . . 5 |- F = ran ( x e. X |-> <. A , B >. )
3	2	eleq2i 2305	. . . 4 |- ( <. C , D >. e. F <-> <. C , D >. e. ran ( x e. X |-> <. A , B >. ) )
4	1, 3	bitri 184	. . 3 |- ( C F D <-> <. C , D >. e. ran ( x e. X |-> <. A , B >. ) )
5		flift.2	. . . . . 6 |- ( ( ph /\ x e. X ) -> A e. R )
6		flift.3	. . . . . 6 |- ( ( ph /\ x e. X ) -> B e. S )
7		opexg 4363	. . . . . 6 |- ( ( A e. R /\ B e. S ) -> <. A , B >. e. _V )
8	5, 6, 7	syl2anc 415	. . . . 5 |- ( ( ph /\ x e. X ) -> <. A , B >. e. _V )
9	8	ralrimiva 2623	. . . 4 |- ( ph -> A. x e. X <. A , B >. e. _V )
10		eqid 2238	. . . . 5 |- ( x e. X |-> <. A , B >. ) = ( x e. X |-> <. A , B >. )
11	10	elrnmptg 5029	. . . 4 |- ( A. x e. X <. A , B >. e. _V -> ( <. C , D >. e. ran ( x e. X |-> <. A , B >. ) <-> E. x e. X <. C , D >. = <. A , B >. ) )
12	9, 11	syl 14	. . 3 |- ( ph -> ( <. C , D >. e. ran ( x e. X |-> <. A , B >. ) <-> E. x e. X <. C , D >. = <. A , B >. ) )
13	4, 12	bitrid 192	. 2 |- ( ph -> ( C F D <-> E. x e. X <. C , D >. = <. A , B >. ) )
14		opthg2 4374	. . . 4 |- ( ( A e. R /\ B e. S ) -> ( <. C , D >. = <. A , B >. <-> ( C = A /\ D = B ) ) )
15	5, 6, 14	syl2anc 415	. . 3 |- ( ( ph /\ x e. X ) -> ( <. C , D >. = <. A , B >. <-> ( C = A /\ D = B ) ) )
16	15	rexbidva 2547	. 2 |- ( ph -> ( E. x e. X <. C , D >. = <. A , B >. <-> E. x e. X ( C = A /\ D = B ) ) )
17	13, 16	bitrd 188	1 |- ( ph -> ( C F D <-> E. x e. X ( C = A /\ D = B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   _Vcvv 2821   <.cop 3708   class class class wbr 4125   |-> cmpt 4187   ran crn 4770

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-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 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-mpt 4189  df-cnv 4777  df-dm 4779  df-rn 4780

This theorem is referenced by:  fliftcnv  5991  fliftfun  5992  fliftf  5995  fliftval  5996  qliftel  6879