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

Theorem addlocpr 6691
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 6658 to both 𝐴 and 𝐵, and uses nqtri3or 6551 rather than prloc 6646 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 6563 . . . . . 6 ((𝑞Q𝑟Q) → (𝑞 <Q 𝑟 ↔ ∃𝑝Q (𝑞 +Q 𝑝) = 𝑟))
21biimpa 284 . . . . 5 (((𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝Q (𝑞 +Q 𝑝) = 𝑟)
323adant1 933 . . . 4 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) → ∃𝑝Q (𝑞 +Q 𝑝) = 𝑟)
4 halfnqq 6565 . . . . . 6 (𝑝Q → ∃Q ( +Q ) = 𝑝)
54ad2antrl 467 . . . . 5 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → ∃Q ( +Q ) = 𝑝)
6 prop 6630 . . . . . . . . . 10 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
7 prarloc 6658 . . . . . . . . . 10 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ PQ) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
86, 7sylan 271 . . . . . . . . 9 ((𝐴PQ) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
98adantlr 454 . . . . . . . 8 (((𝐴P𝐵P) ∧ Q) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
1093ad2antl1 1077 . . . . . . 7 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ Q) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
1110ad2ant2r 486 . . . . . 6 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → ∃𝑑 ∈ (1st𝐴)∃𝑢 ∈ (2nd𝐴)𝑢 <Q (𝑑 +Q ))
12 prop 6630 . . . . . . . . . . . . . 14 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
13 prarloc 6658 . . . . . . . . . . . . . 14 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ PQ) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1412, 13sylan 271 . . . . . . . . . . . . 13 ((𝐵PQ) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1514adantll 453 . . . . . . . . . . . 12 (((𝐴P𝐵P) ∧ Q) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
16153ad2antl1 1077 . . . . . . . . . . 11 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ Q) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1716ad2ant2r 486 . . . . . . . . . 10 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
1817adantr 265 . . . . . . . . 9 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → ∃𝑒 ∈ (1st𝐵)∃𝑡 ∈ (2nd𝐵)𝑡 <Q (𝑒 +Q ))
19 simpll1 954 . . . . . . . . . . . . . 14 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝐴P𝐵P))
2019ad2antrr 465 . . . . . . . . . . . . 13 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → (𝐴P𝐵P))
2120simpld 109 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝐴P)
2220simprd 111 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝐵P)
23 simpll3 956 . . . . . . . . . . . . 13 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → 𝑞 <Q 𝑟)
2423ad2antrr 465 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑞 <Q 𝑟)
25 simplrl 495 . . . . . . . . . . . . 13 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → Q)
2625adantr 265 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → Q)
27 simplrr 496 . . . . . . . . . . . . . 14 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝑞 +Q 𝑝) = 𝑟)
28 oveq2 5547 . . . . . . . . . . . . . . . 16 (( +Q ) = 𝑝 → (𝑞 +Q ( +Q )) = (𝑞 +Q 𝑝))
2928eqeq1d 2064 . . . . . . . . . . . . . . 15 (( +Q ) = 𝑝 → ((𝑞 +Q ( +Q )) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
3029ad2antll 468 . . . . . . . . . . . . . 14 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → ((𝑞 +Q ( +Q )) = 𝑟 ↔ (𝑞 +Q 𝑝) = 𝑟))
3127, 30mpbird 160 . . . . . . . . . . . . 13 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) → (𝑞 +Q ( +Q )) = 𝑟)
3231ad2antrr 465 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → (𝑞 +Q ( +Q )) = 𝑟)
33 simprll 497 . . . . . . . . . . . . 13 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → 𝑑 ∈ (1st𝐴))
3433adantr 265 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑑 ∈ (1st𝐴))
35 simprlr 498 . . . . . . . . . . . . 13 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) → 𝑢 ∈ (2nd𝐴))
3635adantr 265 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑢 ∈ (2nd𝐴))
37 simplrr 496 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑢 <Q (𝑑 +Q ))
38 simprll 497 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑒 ∈ (1st𝐵))
39 simprlr 498 . . . . . . . . . . . 12 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → 𝑡 ∈ (2nd𝐵))
40 simprr 492 . . . . . . . . . . . 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 6690 . . . . . . . . . . 11 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ ((𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵)) ∧ 𝑡 <Q (𝑒 +Q ))) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
4241expr 361 . . . . . . . . . 10 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)) ∧ 𝑢 <Q (𝑑 +Q ))) ∧ (𝑒 ∈ (1st𝐵) ∧ 𝑡 ∈ (2nd𝐵))) → (𝑡 <Q (𝑒 +Q ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
4342rexlimdvva 2457 . . . . . . . . 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 361 . . . . . . 7 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) ∧ (Q ∧ ( +Q ) = 𝑝)) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴))) → (𝑢 <Q (𝑑 +Q ) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
4645rexlimdvva 2457 . . . . . 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 2454 . . . 4 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) ∧ (𝑝Q ∧ (𝑞 +Q 𝑝) = 𝑟)) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
493, 48rexlimddv 2454 . . 3 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q) ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))
50493expia 1117 . 2 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) → (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
5150ralrimivva 2418 1 ((𝐴P𝐵P) → ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  wo 639  w3a 896   = wceq 1259  wcel 1409  wral 2323  wrex 2324  cop 3405   class class class wbr 3791  cfv 4929  (class class class)co 5539  1st c1st 5792  2nd c2nd 5793  Qcnq 6435   +Q cplq 6437   <Q cltq 6440  Pcnp 6446   +P cpp 6448
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-nul 3910  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-iinf 4338
This theorem depends on definitions:  df-bi 114  df-dc 754  df-3or 897  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-int 3643  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-tr 3882  df-eprel 4053  df-id 4057  df-po 4060  df-iso 4061  df-iord 4130  df-on 4132  df-suc 4135  df-iom 4341  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-ov 5542  df-oprab 5543  df-mpt2 5544  df-1st 5794  df-2nd 5795  df-recs 5950  df-irdg 5987  df-1o 6031  df-2o 6032  df-oadd 6035  df-omul 6036  df-er 6136  df-ec 6138  df-qs 6142  df-ni 6459  df-pli 6460  df-mi 6461  df-lti 6462  df-plpq 6499  df-mpq 6500  df-enq 6502  df-nqqs 6503  df-plqqs 6504  df-mqqs 6505  df-1nqqs 6506  df-rq 6507  df-ltnqqs 6508  df-enq0 6579  df-nq0 6580  df-0nq0 6581  df-plq0 6582  df-mq0 6583  df-inp 6621  df-iplp 6623
This theorem is referenced by:  addclpr  6692
  Copyright terms: Public domain W3C validator