Theorem recexprlemlol 7906

Description: The lower cut of B is lower. Lemma for recexpr 7918. (Contributed by Jim Kingdon, 28-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
recexprlemlol	|- ( ( A e. P. /\ q e. Q. ) -> ( E. r e. Q. ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) ) )

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

Proof of Theorem recexprlemlol

Step	Hyp	Ref	Expression
1		ltsonq 7678	. . . . . . . . 9 |- <Q Or Q.
2		ltrelnq 7645	. . . . . . . . 9 |- <Q C_ ( Q. X. Q. )
3	1, 2	sotri 5139	. . . . . . . 8 |- ( ( q <Q r /\ r <Q y ) -> q <Q y )
4	3	ex 115	. . . . . . 7 |- ( q <Q r -> ( r <Q y -> q <Q y ) )
5	4	anim1d 336	. . . . . 6 |- ( q <Q r -> ( ( r <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
6	5	eximdv 1928	. . . . 5 |- ( q <Q r -> ( E. y ( r <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> E. y ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
7		recexpr.1	. . . . . 6 |- B = <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >.
8	7	recexprlemell 7902	. . . . 5 |- ( r e. ( 1st ` B ) <-> E. y ( r <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) )
9	7	recexprlemell 7902	. . . . 5 |- ( q e. ( 1st ` B ) <-> E. y ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) )
10	6, 8, 9	3imtr4g 205	. . . 4 |- ( q <Q r -> ( r e. ( 1st ` B ) -> q e. ( 1st ` B ) ) )
11	10	imp 124	. . 3 |- ( ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) )
12	11	rexlimivw 2647	. 2 |- ( E. r e. Q. ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) )
13	12	a1i 9	1 |- ( ( A e. P. /\ q e. Q. ) -> ( E. r e. Q. ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   E.wex 1541   e. wcel 2202   {cab 2217   E.wrex 2512   <.cop 3676   class class class wbr 4093   ` cfv 5333   1stc1st 6310   2ndc2nd 6311   Q.cnq 7560   *Qcrq 7564   <Q cltq 7565   P.cnp 7571

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-in1 619  ax-in2 620  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-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7584  df-mi 7586  df-lti 7587  df-enq 7627  df-nqqs 7628  df-ltnqqs 7633

This theorem is referenced by:  recexprlemrnd  7909