Theorem fliftel 5966

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 4110	. . . 4 |- ( C F D <-> <. C , D >. e. F )
2		flift.1	. . . . 5 |- F = ran ( x e. X |-> <. A , B >. )
3	2	eleq2i 2299	. . . 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 4344	. . . . . 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 2615	. . . 4 |- ( ph -> A. x e. X <. A , B >. e. _V )
10		eqid 2232	. . . . 5 |- ( x e. X |-> <. A , B >. ) = ( x e. X |-> <. A , B >. )
11	10	elrnmptg 5009	. . . 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 4355	. . . 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 2539	. 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 1398   e. wcel 2203   A.wral 2520   E.wrex 2521   _Vcvv 2813   <.cop 3692   class class class wbr 4109   |-> cmpt 4171   ran crn 4750

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-mpt 4173  df-cnv 4757  df-dm 4759  df-rn 4760

This theorem is referenced by:  fliftcnv  5968  fliftfun  5969  fliftf  5972  fliftval  5973  qliftel  6849