Theorem addlocpr 7904

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 7871 to both 𝐴 and 𝐵, and uses nqtri3or 7764 rather than prloc 7859 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 7776	. . . . . 6 ⊢ ((𝑞 ∈ Q ∧ 𝑟 ∈ Q) → (𝑞 <Q 𝑟 ↔ ∃𝑝 ∈ Q (𝑞 +Q 𝑝) = 𝑟))
2	1	biimpa 296	. . . . 5 ⊢ (((𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝 ∈ Q (𝑞 +Q 𝑝) = 𝑟)
3	2	3adant1 1046	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝 ∈ Q (𝑞 +Q 𝑝) = 𝑟)
4		halfnqq 7778	. . . . . 6 ⊢ (𝑝 ∈ Q → ∃ℎ ∈ Q (ℎ +Q ℎ) = 𝑝)
5	4	ad2antrl 494	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → ∃ℎ ∈ Q (ℎ +Q ℎ) = 𝑝)
6		prop 7843	. . . . . . . . . 10 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
7		prarloc 7871	. . . . . . . . . 10 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
8	6, 7	sylan 283	. . . . . . . . 9 ⊢ ((𝐴 ∈ P ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
9	8	adantlr 481	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
10	9	3ad2antl1 1190	. . . . . . 7 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ ℎ ∈ Q) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
11	10	ad2ant2r 513	. . . . . 6 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → ∃𝑑 ∈ (1st ‘𝐴)∃𝑢 ∈ (2nd ‘𝐴)𝑢 <Q (𝑑 +Q ℎ))
12		prop 7843	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
13		prarloc 7871	. . . . . . . . . . . . . 14 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
14	12, 13	sylan 283	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
15	14	adantll 480	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
16	15	3ad2antl1 1190	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ ℎ ∈ Q) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
17	16	ad2ant2r 513	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
18	17	adantr 276	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → ∃𝑒 ∈ (1st ‘𝐵)∃𝑡 ∈ (2nd ‘𝐵)𝑡 <Q (𝑒 +Q ℎ))
19		simpll1 1067	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝐴 ∈ P ∧ 𝐵 ∈ P))
20	19	ad2antrr 492	. . . . . . . . . . . . 13 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → (𝐴 ∈ P ∧ 𝐵 ∈ P))
21	20	simpld 112	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝐴 ∈ P)
22	20	simprd 114	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝐵 ∈ P)
23		simpll3 1069	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → 𝑞 <Q 𝑟)
24	23	ad2antrr 492	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑞 <Q 𝑟)
25		simplrl 541	. . . . . . . . . . . . 13 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → ℎ ∈ Q)
26	25	adantr 276	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → ℎ ∈ Q)
27		simplrr 542	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝑞 +Q 𝑝) = 𝑟)
28		oveq2 6093	. . . . . . . . . . . . . . . 16 ⊢ ((ℎ +Q ℎ) = 𝑝 → (𝑞 +Q (ℎ +Q ℎ)) = (𝑞 +Q 𝑝))
29	28	eqeq1d 2247	. . . . . . . . . . . . . . 15 ⊢ ((ℎ +Q ℎ) = 𝑝 → ((𝑞 +Q (ℎ +Q ℎ)) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
30	29	ad2antll 495	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → ((𝑞 +Q (ℎ +Q ℎ)) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
31	27, 30	mpbird 167	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) → (𝑞 +Q (ℎ +Q ℎ)) = 𝑟)
32	31	ad2antrr 492	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → (𝑞 +Q (ℎ +Q ℎ)) = 𝑟)
33		simprll 543	. . . . . . . . . . . . 13 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → 𝑑 ∈ (1st ‘𝐴))
34	33	adantr 276	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑑 ∈ (1st ‘𝐴))
35		simprlr 544	. . . . . . . . . . . . 13 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) → 𝑢 ∈ (2nd ‘𝐴))
36	35	adantr 276	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑢 ∈ (2nd ‘𝐴))
37		simplrr 542	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑢 <Q (𝑑 +Q ℎ))
38		simprll 543	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑒 ∈ (1st ‘𝐵))
39		simprlr 544	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ ((𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴)) ∧ 𝑢 <Q (𝑑 +Q ℎ))) ∧ ((𝑒 ∈ (1st ‘𝐵) ∧ 𝑡 ∈ (2nd ‘𝐵)) ∧ 𝑡 <Q (𝑒 +Q ℎ))) → 𝑡 ∈ (2nd ‘𝐵))
40		simprr 537	. . . . . . . . . . . 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 7903	. . . . . . . . . . 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 375	. . . . . . . . . 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 2676	. . . . . . . . 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 375	. . . . . . 7 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (ℎ ∈ Q ∧ (ℎ +Q ℎ) = 𝑝)) ∧ (𝑑 ∈ (1st ‘𝐴) ∧ 𝑢 ∈ (2nd ‘𝐴))) → (𝑢 <Q (𝑑 +Q ℎ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
46	45	rexlimdvva 2676	. . . . . 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 2673	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝 ∈ Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
49	3, 48	rexlimddv 2673	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q) ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
50	49	3expia 1236	. 2 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ Q ∧ 𝑟 ∈ Q)) → (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
51	50	ralrimivva 2632	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ⟨cop 3712   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  1^st c1st 6372  2^nd c2nd 6373  Qcnq 7648   +_Q cplq 7650   <_Q cltq 7653  Pcnp 7659   +_P cpp 7661

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-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7672  df-pli 7673  df-mi 7674  df-lti 7675  df-plpq 7712  df-mpq 7713  df-enq 7715  df-nqqs 7716  df-plqqs 7717  df-mqqs 7718  df-1nqqs 7719  df-rq 7720  df-ltnqqs 7721  df-enq0 7792  df-nq0 7793  df-0nq0 7794  df-plq0 7795  df-mq0 7796  df-inp 7834  df-iplp 7836

This theorem is used by:  addclpr  7905