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

Theorem mullocpr 7781
Description: Locatedness of multiplication on positive reals. Lemma 12.9 in [BauerTaylor], p. 56 (but where both 𝐴 and 𝐵 are positive, not just 𝐴). (Contributed by Jim Kingdon, 8-Dec-2019.)
Assertion
Ref Expression
mullocpr ((𝐴P𝐵P) → ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵)))))
Distinct variable groups:   𝐴,𝑞,𝑟   𝐵,𝑞,𝑟

Proof of Theorem mullocpr
Dummy variables 𝑑 𝑒 𝑡 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7685 . . . . . . . 8 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
2 prmuloc 7776 . . . . . . . 8 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑞 <Q 𝑟) → ∃𝑑Q𝑢Q (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))
31, 2sylan 283 . . . . . . 7 ((𝐴P𝑞 <Q 𝑟) → ∃𝑑Q𝑢Q (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))
4 r2ex 2550 . . . . . . 7 (∃𝑑Q𝑢Q (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)) ↔ ∃𝑑𝑢((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))))
53, 4sylib 122 . . . . . 6 ((𝐴P𝑞 <Q 𝑟) → ∃𝑑𝑢((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))))
65adantlr 477 . . . . 5 (((𝐴P𝐵P) ∧ 𝑞 <Q 𝑟) → ∃𝑑𝑢((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))))
76adantlr 477 . . . 4 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) → ∃𝑑𝑢((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))))
8 simprr3 1071 . . . . . . . 8 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))
9 simprl 529 . . . . . . . . 9 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝑑Q𝑢Q))
10 mulclnq 7586 . . . . . . . . 9 ((𝑑Q𝑢Q) → (𝑑 ·Q 𝑢) ∈ Q)
119, 10syl 14 . . . . . . . 8 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝑑 ·Q 𝑢) ∈ Q)
12 appdivnq 7773 . . . . . . . 8 (((𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟) ∧ (𝑑 ·Q 𝑢) ∈ Q) → ∃𝑒Q ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))
138, 11, 12syl2anc 411 . . . . . . 7 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → ∃𝑒Q ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))
14 simprrr 540 . . . . . . . . 9 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟))
1511adantr 276 . . . . . . . . 9 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑑 ·Q 𝑢) ∈ Q)
16 appdivnq 7773 . . . . . . . . 9 (((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟) ∧ (𝑑 ·Q 𝑢) ∈ Q) → ∃𝑡Q ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))
1714, 15, 16syl2anc 411 . . . . . . . 8 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → ∃𝑡Q ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))
18 simplll 533 . . . . . . . . . 10 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝐴P𝐵P))
1918ad2antrr 488 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝐴P𝐵P))
20 simprl 529 . . . . . . . . . 10 ((𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟))) → (𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)))
2120ad2antlr 489 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)))
22 simprrl 539 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)))
23 simprrr 540 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟))
24 simpllr 534 . . . . . . . . . 10 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝑞Q𝑟Q))
2524ad2antrr 488 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑞Q𝑟Q))
269ad2antrr 488 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑑Q𝑢Q))
27 3simpa 1018 . . . . . . . . . . 11 ((𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)) → (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)))
2827ad2antll 491 . . . . . . . . . 10 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)))
2928ad2antrr 488 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴)))
30 simplrl 535 . . . . . . . . . 10 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → 𝑒Q)
31 simprl 529 . . . . . . . . . 10 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → 𝑡Q)
3230, 31jca 306 . . . . . . . . 9 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑒Q𝑡Q))
3319, 21, 22, 23, 25, 26, 29, 32mullocprlem 7780 . . . . . . . 8 (((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑡Q ∧ ((𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑡 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑡 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵))))
3417, 33rexlimddv 2653 . . . . . . 7 ((((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) ∧ (𝑒Q ∧ ((𝑢 ·Q 𝑞) <Q (𝑒 ·Q (𝑑 ·Q 𝑢)) ∧ (𝑒 ·Q (𝑑 ·Q 𝑢)) <Q (𝑑 ·Q 𝑟)))) → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵))))
3513, 34rexlimddv 2653 . . . . . 6 (((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) ∧ ((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟)))) → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵))))
3635ex 115 . . . . 5 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) → (((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))) → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵)))))
3736exlimdvv 1944 . . . 4 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) → (∃𝑑𝑢((𝑑Q𝑢Q) ∧ (𝑑 ∈ (1st𝐴) ∧ 𝑢 ∈ (2nd𝐴) ∧ (𝑢 ·Q 𝑞) <Q (𝑑 ·Q 𝑟))) → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵)))))
387, 37mpd 13 . . 3 ((((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵))))
3938ex 115 . 2 (((𝐴P𝐵P) ∧ (𝑞Q𝑟Q)) → (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵)))))
4039ralrimivva 2612 1 ((𝐴P𝐵P) → ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 ·P 𝐵)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 713  w3a 1002  wex 1538  wcel 2200  wral 2508  wrex 2509  cop 3670   class class class wbr 4086  cfv 5324  (class class class)co 6013  1st c1st 6296  2nd c2nd 6297  Qcnq 7490   ·Q cmq 7493   <Q cltq 7495  Pcnp 7501   ·P cmp 7504
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-eprel 4384  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-1o 6577  df-2o 6578  df-oadd 6581  df-omul 6582  df-er 6697  df-ec 6699  df-qs 6703  df-ni 7514  df-pli 7515  df-mi 7516  df-lti 7517  df-plpq 7554  df-mpq 7555  df-enq 7557  df-nqqs 7558  df-plqqs 7559  df-mqqs 7560  df-1nqqs 7561  df-rq 7562  df-ltnqqs 7563  df-enq0 7634  df-nq0 7635  df-0nq0 7636  df-plq0 7637  df-mq0 7638  df-inp 7676  df-imp 7679
This theorem is referenced by:  mulclpr  7782
  Copyright terms: Public domain W3C validator