ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  addlocpr GIF version

Theorem addlocpr 6998
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 6965 to both 𝐴 and 𝐵, and uses nqtri3or 6858 rather than prloc 6953 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.
StepHypRef Expression
1 ltexnqq 6870 . . . . . 6 ((𝑞Q𝑟Q) → (𝑞 <Q 𝑟 ↔ ∃𝑝Q (𝑞 +Q 𝑝) = 𝑟))
21biimpa 290 . . . . 5 (((𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝Q (𝑞 +Q 𝑝) = 𝑟)
323adant1 957 . . . 4 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝Q (𝑞 +Q 𝑝) = 𝑟)
4 halfnqq 6872 . . . . . 6 (𝑝Q → ∃Q ( +Q ) = 𝑝)
54ad2antrl 474 . . . . 5 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → ∃Q ( +Q ) = 𝑝)
6 prop 6937 . . . . . . . . . 10 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
7 prarloc 6965 . . . . . . . . . 10 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ PQ) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
86, 7sylan 277 . . . . . . . . 9 ((𝐴PQ) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
98adantlr 461 . . . . . . . 8 (((𝐴P𝐵P) ∧ Q) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
1093ad2antl1 1101 . . . . . . 7 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ Q) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
1110ad2ant2r 493 . . . . . 6 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
12 prop 6937 . . . . . . . . . . . . . 14 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
13 prarloc 6965 . . . . . . . . . . . . . 14 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ PQ) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1412, 13sylan 277 . . . . . . . . . . . . 13 ((𝐵PQ) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1514adantll 460 . . . . . . . . . . . 12 (((𝐴P𝐵P) ∧ Q) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
16153ad2antl1 1101 . . . . . . . . . . 11 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ Q) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1716ad2ant2r 493 . . . . . . . . . 10 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1817adantr 270 . . . . . . . . 9 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
19 simpll1 978 . . . . . . . . . . . . . 14 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝐴P𝐵P))
2019ad2antrr 472 . . . . . . . . . . . . 13 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → (𝐴P𝐵P))
2120simpld 110 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝐴P)
2220simprd 112 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝐵P)
23 simpll3 980 . . . . . . . . . . . . 13 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → 𝑞 <Q 𝑟)
2423ad2antrr 472 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑞 <Q 𝑟)
25 simplrl 502 . . . . . . . . . . . . 13 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → Q)
2625adantr 270 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → Q)
27 simplrr 503 . . . . . . . . . . . . . 14 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝑞 +Q 𝑝) = 𝑟)
28 oveq2 5599 . . . . . . . . . . . . . . . 16 (( +Q ) = 𝑝 → (𝑞 +Q ( +Q )) = (𝑞 +Q 𝑝))
2928eqeq1d 2091 . . . . . . . . . . . . . . 15 (( +Q ) = 𝑝 → ((𝑞 +Q ( +Q )) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
3029ad2antll 475 . . . . . . . . . . . . . 14 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → ((𝑞 +Q ( +Q )) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
3127, 30mpbird 165 . . . . . . . . . . . . 13 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝑞 +Q ( +Q )) = 𝑟)
3231ad2antrr 472 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → (𝑞 +Q ( +Q )) = 𝑟)
33 simprll 504 . . . . . . . . . . . . 13 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → 𝑑 ∈ (1st𝐴))
3433adantr 270 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑑 ∈ (1st𝐴))
35 simprlr 505 . . . . . . . . . . . . 13 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → 𝑢 ∈ (2nd𝐴))
3635adantr 270 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑢 ∈ (2nd𝐴))
37 simplrr 503 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑢 <Q (𝑑 +Q ))
38 simprll 504 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑒 ∈ (1st𝐵))
39 simprlr 505 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑡 ∈ (2nd𝐵))
40 simprr 499 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑡 <Q (𝑒 +Q ))
4121, 22, 24, 26, 32, 34, 36, 37, 38, 39, 40addlocprlem 6997 . . . . . . . . . . 11 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
4241expr 367 . . . . . . . . . 10 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ (𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵))) → (𝑡 <Q (𝑒 +Q ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
4342rexlimdvva 2490 . . . . . . . . 9 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → (∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
4418, 43mpd 13 . . . . . . . 8 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
4544expr 367 . . . . . . 7 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴))) → (𝑢 <Q (𝑑 +Q ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
4645rexlimdvva 2490 . . . . . 6 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
4711, 46mpd 13 . . . . 5 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
485, 47rexlimddv 2487 . . . 4 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
493, 48rexlimddv 2487 . . 3 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
50493expia 1141 . 2 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) → (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
5150ralrimivva 2449 1 ((𝐴P𝐵P) → ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103  wo 662  w3a 920   = wceq 1285  wcel 1434  wral 2353  wrex 2354  cop 3425   class class class wbr 3811  cfv 4969  (class class class)co 5591  1st c1st 5844  2nd c2nd 5845  Qcnq 6742   +Q cplq 6744   <Q cltq 6747  Pcnp 6753   +P cpp 6755
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3919  ax-sep 3922  ax-nul 3930  ax-pow 3974  ax-pr 4000  ax-un 4224  ax-setind 4316  ax-iinf 4366
This theorem depends on definitions:  df-bi 115  df-dc 777  df-3or 921  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2614  df-sbc 2827  df-csb 2920  df-dif 2986  df-un 2988  df-in 2990  df-ss 2997  df-nul 3270  df-pw 3408  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-int 3663  df-iun 3706  df-br 3812  df-opab 3866  df-mpt 3867  df-tr 3902  df-eprel 4080  df-id 4084  df-po 4087  df-iso 4088  df-iord 4157  df-on 4159  df-suc 4162  df-iom 4369  df-xp 4407  df-rel 4408  df-cnv 4409  df-co 4410  df-dm 4411  df-rn 4412  df-res 4413  df-ima 4414  df-iota 4934  df-fun 4971  df-fn 4972  df-f 4973  df-f1 4974  df-fo 4975  df-f1o 4976  df-fv 4977  df-ov 5594  df-oprab 5595  df-mpt2 5596  df-1st 5846  df-2nd 5847  df-recs 6002  df-irdg 6067  df-1o 6113  df-2o 6114  df-oadd 6117  df-omul 6118  df-er 6222  df-ec 6224  df-qs 6228  df-ni 6766  df-pli 6767  df-mi 6768  df-lti 6769  df-plpq 6806  df-mpq 6807  df-enq 6809  df-nqqs 6810  df-plqqs 6811  df-mqqs 6812  df-1nqqs 6813  df-rq 6814  df-ltnqqs 6815  df-enq0 6886  df-nq0 6887  df-0nq0 6888  df-plq0 6889  df-mq0 6890  df-inp 6928  df-iplp 6930
This theorem is referenced by:  addclpr  6999
  Copyright terms: Public domain W3C validator