Theorem addlocprlemeqgt 7899

Description: Lemma for addlocpr 7903. 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 7842	. . . . . 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 7849	. . . . 5 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ U e. ( 2nd ` A ) ) -> U e. Q. )
8	5, 6, 7	syl2anc 415	. . . 4 |- ( ph -> U e. Q. )
9		addlocprlem.dlo	. . . . . 6 |- ( ph -> D e. ( 1st ` A ) )
10		elprnql 7848	. . . . . 6 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ D e. ( 1st ` A ) ) -> D e. Q. )
11	5, 9, 10	syl2anc 415	. . . . 5 |- ( ph -> D e. Q. )
12		addlocprlem.p	. . . . 5 |- ( ph -> P e. Q. )
13		addclnq 7742	. . . . 5 |- ( ( D e. Q. /\ P e. Q. ) -> ( D +Q P ) e. Q. )
14	11, 12, 13	syl2anc 415	. . . 4 |- ( ph -> ( D +Q P ) e. Q. )
15		addlocprlem.b	. . . . . 6 |- ( ph -> B e. P. )
16		prop 7842	. . . . . 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 7849	. . . . 5 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ T e. ( 2nd ` B ) ) -> T e. Q. )
20	17, 18, 19	syl2anc 415	. . . 4 |- ( ph -> T e. Q. )
21		addlocprlem.elo	. . . . . 6 |- ( ph -> E e. ( 1st ` B ) )
22		elprnql 7848	. . . . . 6 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ E e. ( 1st ` B ) ) -> E e. Q. )
23	17, 21, 22	syl2anc 415	. . . . 5 |- ( ph -> E e. Q. )
24		addclnq 7742	. . . . 5 |- ( ( E e. Q. /\ P e. Q. ) -> ( E +Q P ) e. Q. )
25	23, 12, 24	syl2anc 415	. . . 4 |- ( ph -> ( E +Q P ) e. Q. )
26		lt2addnq 7771	. . . 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 1279	. . 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 437	. 2 |- ( ph -> ( U +Q T ) <Q ( ( D +Q P ) +Q ( E +Q P ) ) )
29		addcomnqg 7748	. . . 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 7749	. . . 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 7742	. . . 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 6274	. 2 |- ( ph -> ( ( D +Q P ) +Q ( E +Q P ) ) = ( ( D +Q E ) +Q ( P +Q P ) ) )
36	28, 35	breqtrd 4156	1 |- ( ph -> ( U +Q T ) <Q ( ( D +Q E ) +Q ( P +Q P ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   <.cop 3712   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   1stc1st 6372   2ndc2nd 6373   Q.cnq 7647   +Q cplq 7649   <Q cltq 7652   P.cnp 7658

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-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  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-nul 3521  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-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  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-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-ltnqqs 7720  df-inp 7833

This theorem is used by:  addlocprlemeq  7900  addlocprlemgt  7901