Theorem addlocprlemeqgt 7751

Description: Lemma for addlocpr 7755. This is a step used in both the Q = ( D +Q E ) and ( D +Q E ) <Q Q cases. (Contributed by Jim Kingdon, 7-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
addlocprlemeqgt	|- ( ph -> ( U +Q T ) <Q ( ( D +Q E ) +Q ( P +Q P ) ) )

Proof of Theorem addlocprlemeqgt

Dummy variables f g h are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addlocprlem.du	. . 3 |- ( ph -> U <Q ( D +Q P ) )
2		addlocprlem.et	. . 3 |- ( ph -> T <Q ( E +Q P ) )
3		addlocprlem.a	. . . . . 6 |- ( ph -> A e. P. )
4		prop 7694	. . . . . 6 |- ( A e. P. -> <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. )
5	3, 4	syl 14	. . . . 5 |- ( ph -> <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. )
6		addlocprlem.uup	. . . . 5 |- ( ph -> U e. ( 2nd ` A ) )
7		elprnqu 7701	. . . . 5 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ U e. ( 2nd ` A ) ) -> U e. Q. )
8	5, 6, 7	syl2anc 411	. . . 4 |- ( ph -> U e. Q. )
9		addlocprlem.dlo	. . . . . 6 |- ( ph -> D e. ( 1st ` A ) )
10		elprnql 7700	. . . . . 6 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ D e. ( 1st ` A ) ) -> D e. Q. )
11	5, 9, 10	syl2anc 411	. . . . 5 |- ( ph -> D e. Q. )
12		addlocprlem.p	. . . . 5 |- ( ph -> P e. Q. )
13		addclnq 7594	. . . . 5 |- ( ( D e. Q. /\ P e. Q. ) -> ( D +Q P ) e. Q. )
14	11, 12, 13	syl2anc 411	. . . 4 |- ( ph -> ( D +Q P ) e. Q. )
15		addlocprlem.b	. . . . . 6 |- ( ph -> B e. P. )
16		prop 7694	. . . . . 6 |- ( B e. P. -> <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. )
17	15, 16	syl 14	. . . . 5 |- ( ph -> <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. )
18		addlocprlem.tup	. . . . 5 |- ( ph -> T e. ( 2nd ` B ) )
19		elprnqu 7701	. . . . 5 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ T e. ( 2nd ` B ) ) -> T e. Q. )
20	17, 18, 19	syl2anc 411	. . . 4 |- ( ph -> T e. Q. )
21		addlocprlem.elo	. . . . . 6 |- ( ph -> E e. ( 1st ` B ) )
22		elprnql 7700	. . . . . 6 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ E e. ( 1st ` B ) ) -> E e. Q. )
23	17, 21, 22	syl2anc 411	. . . . 5 |- ( ph -> E e. Q. )
24		addclnq 7594	. . . . 5 |- ( ( E e. Q. /\ P e. Q. ) -> ( E +Q P ) e. Q. )
25	23, 12, 24	syl2anc 411	. . . 4 |- ( ph -> ( E +Q P ) e. Q. )
26		lt2addnq 7623	. . . 4 |- ( ( ( U e. Q. /\ ( D +Q P ) e. Q. ) /\ ( T e. Q. /\ ( E +Q P ) e. Q. ) ) -> ( ( U <Q ( D +Q P ) /\ T <Q ( E +Q P ) ) -> ( U +Q T ) <Q ( ( D +Q P ) +Q ( E +Q P ) ) ) )
27	8, 14, 20, 25, 26	syl22anc 1274	. . 3 |- ( ph -> ( ( U <Q ( D +Q P ) /\ T <Q ( E +Q P ) ) -> ( U +Q T ) <Q ( ( D +Q P ) +Q ( E +Q P ) ) ) )
28	1, 2, 27	mp2and 433	. 2 |- ( ph -> ( U +Q T ) <Q ( ( D +Q P ) +Q ( E +Q P ) ) )
29		addcomnqg 7600	. . . 4 |- ( ( f e. Q. /\ g e. Q. ) -> ( f +Q g ) = ( g +Q f ) )
30	29	adantl 277	. . 3 |- ( ( ph /\ ( f e. Q. /\ g e. Q. ) ) -> ( f +Q g ) = ( g +Q f ) )
31		addassnqg 7601	. . . 4 |- ( ( f e. Q. /\ g e. Q. /\ h e. Q. ) -> ( ( f +Q g ) +Q h ) = ( f +Q ( g +Q h ) ) )
32	31	adantl 277	. . 3 |- ( ( ph /\ ( f e. Q. /\ g e. Q. /\ h e. Q. ) ) -> ( ( f +Q g ) +Q h ) = ( f +Q ( g +Q h ) ) )
33		addclnq 7594	. . . 4 |- ( ( f e. Q. /\ g e. Q. ) -> ( f +Q g ) e. Q. )
34	33	adantl 277	. . 3 |- ( ( ph /\ ( f e. Q. /\ g e. Q. ) ) -> ( f +Q g ) e. Q. )
35	11, 12, 23, 30, 32, 12, 34	caov4d 6206	. 2 |- ( ph -> ( ( D +Q P ) +Q ( E +Q P ) ) = ( ( D +Q E ) +Q ( P +Q P ) ) )
36	28, 35	breqtrd 4114	1 |- ( ph -> ( U +Q T ) <Q ( ( D +Q E ) +Q ( P +Q P ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   <.cop 3672   class class class wbr 4088   ` cfv 5326  (class class class)co 6017   1stc1st 6300   2ndc2nd 6301   Q.cnq 7499   +Q cplq 7501   <Q cltq 7504   P.cnp 7510

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-pli 7524  df-mi 7525  df-lti 7526  df-plpq 7563  df-enq 7566  df-nqqs 7567  df-plqqs 7568  df-ltnqqs 7572  df-inp 7685

This theorem is referenced by:  addlocprlemeq  7752  addlocprlemgt  7753