Theorem addlocprlemeq 7900

Description: Lemma for addlocpr 7903. 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 7899	. . . . 5 ⊢ (𝜑 → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
13	12	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
14		oveq1 6092	. . . . 5 ⊢ (𝑄 = (𝐷 +Q 𝐸) → (𝑄 +Q (𝑃 +Q 𝑃)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
15	5, 14	sylan9req 2292	. . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → 𝑅 = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
16	13, 15	breqtrrd 4158	. . 3 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q 𝑅)
17	1, 7	jca 306	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)))
18	2, 10	jca 306	. . . . 5 ⊢ (𝜑 → (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵)))
19		ltrelnq 7732	. . . . . . . 8 ⊢ <Q ⊆ (Q × Q)
20	19	brel 4827	. . . . . . 7 ⊢ (𝑄 <Q 𝑅 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q))
21	20	simprd 114	. . . . . 6 ⊢ (𝑄 <Q 𝑅 → 𝑅 ∈ Q)
22	3, 21	syl 14	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q)
23		addnqpru 7897	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) ∧ 𝑅 ∈ Q) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
24	17, 18, 22, 23	syl21anc 1277	. . . 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 𝐵))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  1^st c1st 6372  2^nd c2nd 6373  Qcnq 7647   +_Q cplq 7649   <_Q cltq 7652  Pcnp 7658   +_P cpp 7660

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-1o 6687  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-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-inp 7833  df-iplp 7835

This theorem is used by:  addlocprlem  7902