Theorem recexprlemell 7989

Description: Membership in the lower cut of B. Lemma for recexpr 8005. (Contributed by Jim Kingdon, 27-Dec-2019.)

Hypothesis

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

Assertion

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

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

Proof of Theorem recexprlemell

Step	Hyp	Ref	Expression
1		elex 2833	. 2 |- ( C e. ( 1st ` B ) -> C e. _V )
2		ltrelnq 7732	. . . . . . 7 |- <Q C_ ( Q. X. Q. )
3	2	brel 4827	. . . . . 6 |- ( C <Q y -> ( C e. Q. /\ y e. Q. ) )
4	3	simpld 112	. . . . 5 |- ( C <Q y -> C e. Q. )
5		elex 2833	. . . . 5 |- ( C e. Q. -> C e. _V )
6	4, 5	syl 14	. . . 4 |- ( C <Q y -> C e. _V )
7	6	adantr 276	. . 3 |- ( ( C <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> C e. _V )
8	7	exlimiv 1651	. 2 |- ( E. y ( C <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> C e. _V )
9		breq1 4133	. . . . 5 |- ( x = C -> ( x <Q y <-> C <Q y ) )
10	9	anbi1d 469	. . . 4 |- ( x = C -> ( ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) <-> ( C <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
11	10	exbidv 1878	. . 3 |- ( x = C -> ( E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) <-> E. y ( C <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
12		recexpr.1	. . . . 5 |- B = <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >.
13	12	fveq2i 5698	. . . 4 |- ( 1st ` B ) = ( 1st ` <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >. )
14		nqex 7730	. . . . . 6 |- Q. e. _V
15	2	brel 4827	. . . . . . . . . 10 |- ( x <Q y -> ( x e. Q. /\ y e. Q. ) )
16	15	simpld 112	. . . . . . . . 9 |- ( x <Q y -> x e. Q. )
17	16	adantr 276	. . . . . . . 8 |- ( ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> x e. Q. )
18	17	exlimiv 1651	. . . . . . 7 |- ( E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> x e. Q. )
19	18	abssi 3323	. . . . . 6 |- { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } C_ Q.
20	14, 19	ssexi 4271	. . . . 5 |- { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } e. _V
21	2	brel 4827	. . . . . . . . . 10 |- ( y <Q x -> ( y e. Q. /\ x e. Q. ) )
22	21	simprd 114	. . . . . . . . 9 |- ( y <Q x -> x e. Q. )
23	22	adantr 276	. . . . . . . 8 |- ( ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) -> x e. Q. )
24	23	exlimiv 1651	. . . . . . 7 |- ( E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) -> x e. Q. )
25	24	abssi 3323	. . . . . 6 |- { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } C_ Q.
26	14, 25	ssexi 4271	. . . . 5 |- { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } e. _V
27	20, 26	op1st 6380	. . . 4 |- ( 1st ` <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >. ) = { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) }
28	13, 27	eqtri 2259	. . 3 |- ( 1st ` B ) = { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) }
29	11, 28	elab2g 2973	. 2 |- ( C e. _V -> ( C e. ( 1st ` B ) <-> E. y ( C <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
30	1, 8, 29	pm5.21nii 716	1 |- ( C e. ( 1st ` B ) <-> E. y ( C <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) )

This proof depends on syntax axioms:   /\ wa 104   <-> wb 105   = wceq 1402   E.wex 1545   e. wcel 2209   {cab 2224   _Vcvv 2821   <.cop 3712   class class class wbr 4130   ` cfv 5377   1stc1st 6372   2ndc2nd 6373   Q.cnq 7647   *Qcrq 7651   <Q cltq 7652

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-iinf 4735

This proof 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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-qs 6813  df-ni 7671  df-nqqs 7715  df-ltnqqs 7720

This theorem is used by:  recexprlemm  7991  recexprlemopl  7992  recexprlemlol  7993  recexprlemdisj  7997  recexprlemloc  7998  recexprlem1ssl  8000  recexprlemss1l  8002