Theorem fliftel 5836

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 4030	. . . 4 |- ( C F D <-> <. C , D >. e. F )
2		flift.1	. . . . 5 |- F = ran ( x e. X |-> <. A , B >. )
3	2	eleq2i 2260	. . . 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 4257	. . . . . 6 |- ( ( A e. R /\ B e. S ) -> <. A , B >. e. _V )
8	5, 6, 7	syl2anc 411	. . . . 5 |- ( ( ph /\ x e. X ) -> <. A , B >. e. _V )
9	8	ralrimiva 2567	. . . 4 |- ( ph -> A. x e. X <. A , B >. e. _V )
10		eqid 2193	. . . . 5 |- ( x e. X |-> <. A , B >. ) = ( x e. X |-> <. A , B >. )
11	10	elrnmptg 4914	. . . 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 4268	. . . 4 |- ( ( A e. R /\ B e. S ) -> ( <. C , D >. = <. A , B >. <-> ( C = A /\ D = B ) ) )
15	5, 6, 14	syl2anc 411	. . 3 |- ( ( ph /\ x e. X ) -> ( <. C , D >. = <. A , B >. <-> ( C = A /\ D = B ) ) )
16	15	rexbidva 2491	. 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 1364   e. wcel 2164   A.wral 2472   E.wrex 2473   _Vcvv 2760   <.cop 3621   class class class wbr 4029   |-> cmpt 4090   ran crn 4660

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-mpt 4092  df-cnv 4667  df-dm 4669  df-rn 4670

This theorem is referenced by:  fliftcnv  5838  fliftfun  5839  fliftf  5842  fliftval  5843  qliftel  6669