Theorem addlocpr 7368

Description: Locatedness of addition on positive reals. Lemma 11.16 in [BauerTaylor], p. 53. The proof in BauerTaylor relies on signed rationals, so we replace it with another proof which applies prarloc 7335 to both 𝐴 and 𝐵, and uses nqtri3or 7228 rather than prloc 7323 to decide whether 𝑞 is too big to be in the lower cut of 𝐴 +_P 𝐵 (and deduce that if it is, then 𝑟 must be in the upper cut). What the two proofs have in common is that they take the difference between 𝑞 and 𝑟 to determine how tight a range they need around the real numbers. (Contributed by Jim Kingdon, 5-Dec-2019.)

Assertion

Ref	Expression
addlocpr	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))

Distinct variable groups:   𝐴,𝑞,𝑟   𝐵,𝑞,𝑟

Proof of Theorem addlocpr

Dummy variables 𝑑 𝑒 ℎ 𝑝 𝑡 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltexnqq 7240	. . . . . 6 ⊢ ((𝑞 ∈ Q ∧ 𝑟 ∈ Q) → (𝑞 <Q 𝑟 ↔ ∃𝑝 ∈ Q (𝑞 +Q 𝑝) = 𝑟))
2	1	biimpa 294	. . . . 5 ⊢ (((𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝 ∈ Q (𝑞 +Q 𝑝) = 𝑟)
3	2	3adant1 1000	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝 ∈ Q (𝑞 +Q 𝑝) = 𝑟)
4		halfnqq 7242	. . . . . 6 ⊢ (𝑝 ∈ Q → ∃ℎ ∈ Q (ℎ +Q ℎ) = 𝑝)
5	4	ad2antrl 482	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → ∃ℎ ∈ Q (ℎ +Q ℎ) = 𝑝)
6		prop 7307	. . . . . . . . . 10 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
7		prarloc 7335	. . . . . . . . . 10 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
8	6, 7	sylan 281	. . . . . . . . 9 ⊢ ((𝐴 ∈ P ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
9	8	adantlr 469	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
10	9	3ad2antl1 1144	. . . . . . 7 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
11	10	ad2ant2r 501	. . . . . 6 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
12		prop 7307	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
13		prarloc 7335	. . . . . . . . . . . . . 14 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
14	12, 13	sylan 281	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
15	14	adantll 468	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
16	15	3ad2antl1 1144	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
17	16	ad2ant2r 501	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
18	17	adantr 274	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
19		simpll1 1021	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝐴 ∈ P ∧ 𝐵 ∈ P))
20	19	ad2antrr 480	. . . . . . . . . . . . 13 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → (𝐴 ∈ P ∧ 𝐵 ∈ P))
21	20	simpld 111	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝐴 ∈ P)
22	20	simprd 113	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝐵 ∈ P)
23		simpll3 1023	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → 𝑞 <Q 𝑟)
24	23	ad2antrr 480	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑞 <Q 𝑟)
25		simplrl 525	. . . . . . . . . . . . 13 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → ℎ ∈ Q)
26	25	adantr 274	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → ℎ ∈ Q)
27		simplrr 526	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝑞 +Q 𝑝) = 𝑟)
28		oveq2 5790	. . . . . . . . . . . . . . . 16 ⊢ ((ℎ +Q ℎ) = 𝑝 → (𝑞 +Q (ℎ +Q ℎ)) = (𝑞 +Q 𝑝))
29	28	eqeq1d 2149	. . . . . . . . . . . . . . 15 ⊢ ((ℎ +Q ℎ) = 𝑝 → ((𝑞 +Q (ℎ +Q ℎ)) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
30	29	ad2antll 483	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → ((𝑞 +Q (ℎ +Q ℎ)) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
31	27, 30	mpbird 166	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝑞 +Q (ℎ +Q ℎ)) = 𝑟)
32	31	ad2antrr 480	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → (𝑞 +Q (ℎ +Q ℎ)) = 𝑟)
33		simprll 527	. . . . . . . . . . . . 13 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → 𝑑 ∈ (1st ‘𝐴))
34	33	adantr 274	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑑 ∈ (1st ‘𝐴))
35		simprlr 528	. . . . . . . . . . . . 13 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → 𝑢 ∈ (2nd ‘𝐴))
36	35	adantr 274	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑢 ∈ (2nd ‘𝐴))
37		simplrr 526	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑢 <Q (𝑑 +Q ℎ))
38		simprll 527	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑒 ∈ (1st ‘𝐵))
39		simprlr 528	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑡 ∈ (2nd ‘𝐵))
40		simprr 522	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑡 <Q (𝑒 +Q ℎ))
41	21, 22, 24, 26, 32, 34, 36, 37, 38, 39, 40	addlocprlem 7367	. . . . . . . . . . 11 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
42	41	expr 373	. . . . . . . . . 10 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ (𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵))) → (𝑡 <Q (𝑒 +Q ℎ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
43	42	rexlimdvva 2560	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → (∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
44	18, 43	mpd 13	. . . . . . . 8 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
45	44	expr 373	. . . . . . 7 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ (𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴))) → (𝑢 <Q (𝑑 +Q ℎ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
46	45	rexlimdvva 2560	. . . . . 6 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
47	11, 46	mpd 13	. . . . 5 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
48	5, 47	rexlimddv 2557	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
49	3, 48	rexlimddv 2557	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
50	49	3expia 1184	. 2 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q)) → (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
51	50	ralrimivva 2517	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698   ∧ w3a 963   = wceq 1332   ∈ wcel 1481  ∀wral 2417  ∃wrex 2418  ⟨cop 3535   class class class wbr 3937  ‘cfv 5131  (class class class)co 5782  1^st c1st 6044  2^nd c2nd 6045  Qcnq 7112   +_Q cplq 7114   <_Q cltq 7117  Pcnp 7123   +_P cpp 7125

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-eprel 4219  df-id 4223  df-po 4226  df-iso 4227  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-irdg 6275  df-1o 6321  df-2o 6322  df-oadd 6325  df-omul 6326  df-er 6437  df-ec 6439  df-qs 6443  df-ni 7136  df-pli 7137  df-mi 7138  df-lti 7139  df-plpq 7176  df-mpq 7177  df-enq 7179  df-nqqs 7180  df-plqqs 7181  df-mqqs 7182  df-1nqqs 7183  df-rq 7184  df-ltnqqs 7185  df-enq0 7256  df-nq0 7257  df-0nq0 7258  df-plq0 7259  df-mq0 7260  df-inp 7298  df-iplp 7300

This theorem is referenced by:  addclpr  7369