Theorem addlocprlemeq 7529

Description: Lemma for addlocpr 7532. The 𝑄 = (𝐷 +_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
addlocprlemeq	⊢ (𝜑 → (𝑄 = (𝐷 +Q 𝐸) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))

Proof of Theorem addlocprlemeq

Step	Hyp	Ref	Expression
1		addlocprlem.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ P)
2		addlocprlem.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ P)
3		addlocprlem.qr	. . . . . 6 ⊢ (𝜑 → 𝑄 <Q 𝑅)
4		addlocprlem.p	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ Q)
5		addlocprlem.qppr	. . . . . 6 ⊢ (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅)
6		addlocprlem.dlo	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (1st ‘𝐴))
7		addlocprlem.uup	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ (2nd ‘𝐴))
8		addlocprlem.du	. . . . . 6 ⊢ (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃))
9		addlocprlem.elo	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (1st ‘𝐵))
10		addlocprlem.tup	. . . . . 6 ⊢ (𝜑 → 𝑇 ∈ (2nd ‘𝐵))
11		addlocprlem.et	. . . . . 6 ⊢ (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃))
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	addlocprlemeqgt 7528	. . . . 5 ⊢ (𝜑 → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
13	12	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
14		oveq1 5879	. . . . 5 ⊢ (𝑄 = (𝐷 +Q 𝐸) → (𝑄 +Q (𝑃 +Q 𝑃)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
15	5, 14	sylan9req 2231	. . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → 𝑅 = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
16	13, 15	breqtrrd 4030	. . 3 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q 𝑅)
17	1, 7	jca 306	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)))
18	2, 10	jca 306	. . . . 5 ⊢ (𝜑 → (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵)))
19		ltrelnq 7361	. . . . . . . 8 ⊢ <Q ⊆ (Q × Q)
20	19	brel 4677	. . . . . . 7 ⊢ (𝑄 <Q 𝑅 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q))
21	20	simprd 114	. . . . . 6 ⊢ (𝑄 <Q 𝑅 → 𝑅 ∈ Q)
22	3, 21	syl 14	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q)
23		addnqpru 7526	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) ∧ 𝑅 ∈ Q) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
24	17, 18, 22, 23	syl21anc 1237	. . . 4 ⊢ (𝜑 → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
25	24	adantr 276	. . 3 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
26	16, 25	mpd 13	. 2 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))
27	26	ex 115	1 ⊢ (𝜑 → (𝑄 = (𝐷 +Q 𝐸) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148   class class class wbr 4002  ‘cfv 5215  (class class class)co 5872  1^st c1st 6136  2^nd c2nd 6137  Qcnq 7276   +_Q cplq 7278   <_Q cltq 7281  Pcnp 7287   +_P cpp 7289

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4117  ax-sep 4120  ax-nul 4128  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-iinf 4586

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4003  df-opab 4064  df-mpt 4065  df-tr 4101  df-eprel 4288  df-id 4292  df-po 4295  df-iso 4296  df-iord 4365  df-on 4367  df-suc 4370  df-iom 4589  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5177  df-fun 5217  df-fn 5218  df-f 5219  df-f1 5220  df-fo 5221  df-f1o 5222  df-fv 5223  df-ov 5875  df-oprab 5876  df-mpo 5877  df-1st 6138  df-2nd 6139  df-recs 6303  df-irdg 6368  df-1o 6414  df-oadd 6418  df-omul 6419  df-er 6532  df-ec 6534  df-qs 6538  df-ni 7300  df-pli 7301  df-mi 7302  df-lti 7303  df-plpq 7340  df-mpq 7341  df-enq 7343  df-nqqs 7344  df-plqqs 7345  df-mqqs 7346  df-1nqqs 7347  df-rq 7348  df-ltnqqs 7349  df-inp 7462  df-iplp 7464

This theorem is referenced by:  addlocprlem  7531