Theorem addlocprlemlt 7332

Description: Lemma for addlocpr 7337. The Q <Q ( D +Q E ) case. (Contributed by Jim Kingdon, 6-Dec-2019.)

Hypotheses

Ref	Expression
addlocprlem.a	|- ( ph -> A e. P. )
addlocprlem.b	|- ( ph -> B e. P. )
addlocprlem.qr	|- ( ph -> Q <Q R )
addlocprlem.p	|- ( ph -> P e. Q. )
addlocprlem.qppr	|- ( ph -> ( Q +Q ( P +Q P ) ) = R )
addlocprlem.dlo	|- ( ph -> D e. ( 1st ` A ) )
addlocprlem.uup	|- ( ph -> U e. ( 2nd ` A ) )
addlocprlem.du	|- ( ph -> U <Q ( D +Q P ) )
addlocprlem.elo	|- ( ph -> E e. ( 1st ` B ) )
addlocprlem.tup	|- ( ph -> T e. ( 2nd ` B ) )
addlocprlem.et	|- ( ph -> T <Q ( E +Q P ) )

Assertion

Ref	Expression
addlocprlemlt	|- ( ph -> ( Q <Q ( D +Q E ) -> Q e. ( 1st ` ( A +P. B ) ) ) )

Proof of Theorem addlocprlemlt

Step	Hyp	Ref	Expression
1		addlocprlem.a	. . 3 |- ( ph -> A e. P. )
2		addlocprlem.dlo	. . 3 |- ( ph -> D e. ( 1st ` A ) )
3	1, 2	jca 304	. 2 |- ( ph -> ( A e. P. /\ D e. ( 1st ` A ) ) )
4		addlocprlem.b	. . 3 |- ( ph -> B e. P. )
5		addlocprlem.elo	. . 3 |- ( ph -> E e. ( 1st ` B ) )
6	4, 5	jca 304	. 2 |- ( ph -> ( B e. P. /\ E e. ( 1st ` B ) ) )
7		addlocprlem.qr	. . 3 |- ( ph -> Q <Q R )
8		ltrelnq 7166	. . . . 5 |- <Q C_ ( Q. X. Q. )
9	8	brel 4586	. . . 4 |- ( Q <Q R -> ( Q e. Q. /\ R e. Q. ) )
10	9	simpld 111	. . 3 |- ( Q <Q R -> Q e. Q. )
11	7, 10	syl 14	. 2 |- ( ph -> Q e. Q. )
12		addnqprl 7330	. 2 |- ( ( ( ( A e. P. /\ D e. ( 1st ` A ) ) /\ ( B e. P. /\ E e. ( 1st ` B ) ) ) /\ Q e. Q. ) -> ( Q <Q ( D +Q E ) -> Q e. ( 1st ` ( A +P. B ) ) ) )
13	3, 6, 11, 12	syl21anc 1215	1 |- ( ph -> ( Q <Q ( D +Q E ) -> Q e. ( 1st ` ( A +P. B ) ) ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1331   e. wcel 1480   class class class wbr 3924   ` cfv 5118  (class class class)co 5767   1stc1st 6029   2ndc2nd 6030   Q.cnq 7081   +Q cplq 7083   <Q cltq 7086   P.cnp 7092   +P. cpp 7094

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-inp 7267  df-iplp 7269

This theorem is referenced by:  addlocprlem  7336