Theorem addlocprlemgt 7154

Description: Lemma for addlocpr 7156. The (𝐷 +_Q 𝐸) <_Q 𝑄 case. (Contributed by Jim Kingdon, 6-Dec-2019.)

Hypotheses

Ref	Expression
addlocprlem.a	⊢ (𝜑 → 𝐴 ∈ P)
addlocprlem.b	⊢ (𝜑 → 𝐵 ∈ P)
addlocprlem.qr	⊢ (𝜑 → 𝑄 <Q 𝑅)
addlocprlem.p	⊢ (𝜑 → 𝑃 ∈ Q)
addlocprlem.qppr	⊢ (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅)
addlocprlem.dlo	⊢ (𝜑 → 𝐷 ∈ (1st ‘𝐴))
addlocprlem.uup	⊢ (𝜑 → 𝑈 ∈ (2nd ‘𝐴))
addlocprlem.du	⊢ (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃))
addlocprlem.elo	⊢ (𝜑 → 𝐸 ∈ (1st ‘𝐵))
addlocprlem.tup	⊢ (𝜑 → 𝑇 ∈ (2nd ‘𝐵))
addlocprlem.et	⊢ (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃))

Assertion

Ref	Expression
addlocprlemgt	⊢ (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))

Proof of Theorem addlocprlemgt

Step	Hyp	Ref	Expression
1		addlocprlem.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ P)
2		addlocprlem.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ P)
3		addlocprlem.qr	. . . . . . 7 ⊢ (𝜑 → 𝑄 <Q 𝑅)
4		addlocprlem.p	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ Q)
5		addlocprlem.qppr	. . . . . . 7 ⊢ (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅)
6		addlocprlem.dlo	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (1st ‘𝐴))
7		addlocprlem.uup	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ (2nd ‘𝐴))
8		addlocprlem.du	. . . . . . 7 ⊢ (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃))
9		addlocprlem.elo	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ (1st ‘𝐵))
10		addlocprlem.tup	. . . . . . 7 ⊢ (𝜑 → 𝑇 ∈ (2nd ‘𝐵))
11		addlocprlem.et	. . . . . . 7 ⊢ (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃))
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	addlocprlemeqgt 7152	. . . . . 6 ⊢ (𝜑 → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
13	12	adantr 271	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
14		prop 7095	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
15	1, 14	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
16		elprnql 7101	. . . . . . . . . . 11 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝐷 ∈ (1st ‘𝐴)) → 𝐷 ∈ Q)
17	15, 6, 16	syl2anc 404	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ Q)
18		prop 7095	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
19	2, 18	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
20		elprnql 7101	. . . . . . . . . . 11 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝐸 ∈ (1st ‘𝐵)) → 𝐸 ∈ Q)
21	19, 9, 20	syl2anc 404	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ Q)
22		addclnq 6995	. . . . . . . . . 10 ⊢ ((𝐷 ∈ Q ∧ 𝐸 ∈ Q) → (𝐷 +Q 𝐸) ∈ Q)
23	17, 21, 22	syl2anc 404	. . . . . . . . 9 ⊢ (𝜑 → (𝐷 +Q 𝐸) ∈ Q)
24		ltrelnq 6985	. . . . . . . . . . . 12 ⊢ <Q ⊆ (Q × Q)
25	24	brel 4503	. . . . . . . . . . 11 ⊢ (𝑄 <Q 𝑅 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q))
26	3, 25	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q))
27	26	simpld 111	. . . . . . . . 9 ⊢ (𝜑 → 𝑄 ∈ Q)
28		addclnq 6995	. . . . . . . . . 10 ⊢ ((𝑃 ∈ Q ∧ 𝑃 ∈ Q) → (𝑃 +Q 𝑃) ∈ Q)
29	4, 4, 28	syl2anc 404	. . . . . . . . 9 ⊢ (𝜑 → (𝑃 +Q 𝑃) ∈ Q)
30		ltanqg 7020	. . . . . . . . 9 ⊢ (((𝐷 +Q 𝐸) ∈ Q ∧ 𝑄 ∈ Q ∧ (𝑃 +Q 𝑃) ∈ Q) → ((𝐷 +Q 𝐸) <Q 𝑄 ↔ ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) <Q ((𝑃 +Q 𝑃) +Q 𝑄)))
31	23, 27, 29, 30	syl3anc 1175	. . . . . . . 8 ⊢ (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 ↔ ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) <Q ((𝑃 +Q 𝑃) +Q 𝑄)))
32		addcomnqg 7001	. . . . . . . . . 10 ⊢ (((𝑃 +Q 𝑃) ∈ Q ∧ (𝐷 +Q 𝐸) ∈ Q) → ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
33	29, 23, 32	syl2anc 404	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
34		addcomnqg 7001	. . . . . . . . . 10 ⊢ (((𝑃 +Q 𝑃) ∈ Q ∧ 𝑄 ∈ Q) → ((𝑃 +Q 𝑃) +Q 𝑄) = (𝑄 +Q (𝑃 +Q 𝑃)))
35	29, 27, 34	syl2anc 404	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃 +Q 𝑃) +Q 𝑄) = (𝑄 +Q (𝑃 +Q 𝑃)))
36	33, 35	breq12d 3864	. . . . . . . 8 ⊢ (𝜑 → (((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) <Q ((𝑃 +Q 𝑃) +Q 𝑄) ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃))))
37	31, 36	bitrd 187	. . . . . . 7 ⊢ (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃))))
38	37	biimpa 291	. . . . . 6 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃)))
39	5	breq2d 3863	. . . . . . 7 ⊢ (𝜑 → (((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃)) ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅))
40	39	adantr 271	. . . . . 6 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → (((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃)) ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅))
41	38, 40	mpbid 146	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅)
42	13, 41	jca 301	. . . 4 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) ∧ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅))
43		ltsonq 7018	. . . . 5 ⊢ <Q Or Q
44	43, 24	sotri 4840	. . . 4 ⊢ (((𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) ∧ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅) → (𝑈 +Q 𝑇) <Q 𝑅)
45	42, 44	syl 14	. . 3 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → (𝑈 +Q 𝑇) <Q 𝑅)
46	1, 7	jca 301	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)))
47	2, 10	jca 301	. . . . 5 ⊢ (𝜑 → (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵)))
48	26	simprd 113	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q)
49		addnqpru 7150	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) ∧ 𝑅 ∈ Q) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
50	46, 47, 48, 49	syl21anc 1174	. . . 4 ⊢ (𝜑 → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
51	50	adantr 271	. . 3 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
52	45, 51	mpd 13	. 2 ⊢ ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))
53	52	ex 114	1 ⊢ (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1290   ∈ wcel 1439  ⟨cop 3453   class class class wbr 3851  ‘cfv 5028  (class class class)co 5666  1^st c1st 5923  2^nd c2nd 5924  Qcnq 6900   +_Q cplq 6902   <_Q cltq 6905  Pcnp 6911   +_P cpp 6913

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-nul 3971  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-iinf 4416

This theorem depends on definitions:  df-bi 116  df-dc 782  df-3or 926  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-nul 3288  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-int 3695  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-tr 3943  df-eprel 4125  df-id 4129  df-po 4132  df-iso 4133  df-iord 4202  df-on 4204  df-suc 4207  df-iom 4419  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-rn 4463  df-res 4464  df-ima 4465  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-1st 5925  df-2nd 5926  df-recs 6084  df-irdg 6149  df-1o 6195  df-oadd 6199  df-omul 6200  df-er 6306  df-ec 6308  df-qs 6312  df-ni 6924  df-pli 6925  df-mi 6926  df-lti 6927  df-plpq 6964  df-mpq 6965  df-enq 6967  df-nqqs 6968  df-plqqs 6969  df-mqqs 6970  df-1nqqs 6971  df-rq 6972  df-ltnqqs 6973  df-inp 7086  df-iplp 7088

This theorem is referenced by:  addlocprlem  7155