Theorem ltexprlemell 6696

Description: Element in lower cut of the constructed difference. Lemma for ltexpri 6711. (Contributed by Jim Kingdon, 21-Dec-2019.)

Hypothesis

Ref	Expression
ltexprlem.1	|- C = <. { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) } , { x e. Q. | E. y ( y e. ( 1st ` A ) /\ ( y +Q x ) e. ( 2nd ` B ) ) } >.

Assertion

Ref	Expression
ltexprlemell	|- ( q e. ( 1st ` C ) <-> ( q e. Q. /\ E. y ( y e. ( 2nd ` A ) /\ ( y +Q q ) e. ( 1st ` B ) ) ) )

Distinct variable groups:   x, y, q, A   x, B, y, q   x, C, y, q

Proof of Theorem ltexprlemell

Step	Hyp	Ref	Expression
1		oveq2 5520	. . . . 5 |- ( x = q -> ( y +Q x ) = ( y +Q q ) )
2	1	eleq1d 2106	. . . 4 |- ( x = q -> ( ( y +Q x ) e. ( 1st ` B ) <-> ( y +Q q ) e. ( 1st ` B ) ) )
3	2	anbi2d 437	. . 3 |- ( x = q -> ( ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) <-> ( y e. ( 2nd ` A ) /\ ( y +Q q ) e. ( 1st ` B ) ) ) )
4	3	exbidv 1706	. 2 |- ( x = q -> ( E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) <-> E. y ( y e. ( 2nd ` A ) /\ ( y +Q q ) e. ( 1st ` B ) ) ) )
5		ltexprlem.1	. . . 4 |- C = <. { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) } , { x e. Q. | E. y ( y e. ( 1st ` A ) /\ ( y +Q x ) e. ( 2nd ` B ) ) } >.
6	5	fveq2i 5181	. . 3 |- ( 1st ` C ) = ( 1st ` <. { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) } , { x e. Q. | E. y ( y e. ( 1st ` A ) /\ ( y +Q x ) e. ( 2nd ` B ) ) } >. )
7		nqex 6461	. . . . 5 |- Q. e. _V
8	7	rabex 3901	. . . 4 |- { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) } e. _V
9	7	rabex 3901	. . . 4 |- { x e. Q. | E. y ( y e. ( 1st ` A ) /\ ( y +Q x ) e. ( 2nd ` B ) ) } e. _V
10	8, 9	op1st 5773	. . 3 |- ( 1st ` <. { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) } , { x e. Q. | E. y ( y e. ( 1st ` A ) /\ ( y +Q x ) e. ( 2nd ` B ) ) } >. ) = { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) }
11	6, 10	eqtri 2060	. 2 |- ( 1st ` C ) = { x e. Q. | E. y ( y e. ( 2nd ` A ) /\ ( y +Q x ) e. ( 1st ` B ) ) }
12	4, 11	elrab2 2700	1 |- ( q e. ( 1st ` C ) <-> ( q e. Q. /\ E. y ( y e. ( 2nd ` A ) /\ ( y +Q q ) e. ( 1st ` B ) ) ) )

Syntax hints:   /\ wa 97   <-> wb 98   = wceq 1243   E.wex 1381   e. wcel 1393   {crab 2310   <.cop 3378   ` cfv 4902  (class class class)co 5512   1stc1st 5765   2ndc2nd 5766   Q.cnq 6378   +Q cplq 6380

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-iinf 4311

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-1st 5767  df-qs 6112  df-ni 6402  df-nqqs 6446

This theorem is referenced by:  ltexprlemm  6698  ltexprlemopl  6699  ltexprlemlol  6700  ltexprlemdisj  6704  ltexprlemloc  6705  ltexprlemfl  6707  ltexprlemrl  6708