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

Theorem genpdisj 7513
Description: The lower and upper cuts produced by addition or multiplication on positive reals are disjoint. (Contributed by Jim Kingdon, 15-Oct-2019.)
Hypotheses
Ref Expression
genpelvl.1 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
genpdisj.ord ((𝑥Q𝑦Q𝑧Q) → (𝑥 <Q 𝑦 ↔ (𝑧𝐺𝑥) <Q (𝑧𝐺𝑦)))
genpdisj.com ((𝑥Q𝑦Q) → (𝑥𝐺𝑦) = (𝑦𝐺𝑥))
Assertion
Ref Expression
genpdisj ((𝐴P𝐵P) → ∀𝑞Q ¬ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑞,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑞   𝑥,𝐺,𝑦,𝑧,𝑤,𝑣,𝑞   𝐹,𝑞
Allowed substitution hints:   𝐹(𝑥,𝑦,𝑧,𝑤,𝑣)

Proof of Theorem genpdisj
Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 genpelvl.1 . . . . . . . . 9 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2 genpelvl.2 . . . . . . . . 9 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
31, 2genpelvl 7502 . . . . . . . 8 ((𝐴P𝐵P) → (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ↔ ∃𝑎 ∈ (1st𝐴)∃𝑏 ∈ (1st𝐵)𝑞 = (𝑎𝐺𝑏)))
4 r2ex 2497 . . . . . . . 8 (∃𝑎 ∈ (1st𝐴)∃𝑏 ∈ (1st𝐵)𝑞 = (𝑎𝐺𝑏) ↔ ∃𝑎𝑏((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)))
53, 4bitrdi 196 . . . . . . 7 ((𝐴P𝐵P) → (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ↔ ∃𝑎𝑏((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏))))
61, 2genpelvu 7503 . . . . . . . 8 ((𝐴P𝐵P) → (𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑐 ∈ (2nd𝐴)∃𝑑 ∈ (2nd𝐵)𝑞 = (𝑐𝐺𝑑)))
7 r2ex 2497 . . . . . . . 8 (∃𝑐 ∈ (2nd𝐴)∃𝑑 ∈ (2nd𝐵)𝑞 = (𝑐𝐺𝑑) ↔ ∃𝑐𝑑((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))
86, 7bitrdi 196 . . . . . . 7 ((𝐴P𝐵P) → (𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑐𝑑((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
95, 8anbi12d 473 . . . . . 6 ((𝐴P𝐵P) → ((𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))) ↔ (∃𝑎𝑏((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ∃𝑐𝑑((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))))
10 ee4anv 1934 . . . . . 6 (∃𝑎𝑏𝑐𝑑(((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) ↔ (∃𝑎𝑏((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ∃𝑐𝑑((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
119, 10bitr4di 198 . . . . 5 ((𝐴P𝐵P) → ((𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))) ↔ ∃𝑎𝑏𝑐𝑑(((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))))
1211biimpa 296 . . . 4 (((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → ∃𝑎𝑏𝑐𝑑(((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
13 an4 586 . . . . . . . . . . . . 13 (((𝑎 ∈ (1st𝐴) ∧ 𝑐 ∈ (2nd𝐴)) ∧ (𝑏 ∈ (1st𝐵) ∧ 𝑑 ∈ (2nd𝐵))) ↔ ((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ (𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵))))
14 prop 7465 . . . . . . . . . . . . . . . 16 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
15 prltlu 7477 . . . . . . . . . . . . . . . . 17 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑎 ∈ (1st𝐴) ∧ 𝑐 ∈ (2nd𝐴)) → 𝑎 <Q 𝑐)
16153expib 1206 . . . . . . . . . . . . . . . 16 (⟨(1st𝐴), (2nd𝐴)⟩ ∈ P → ((𝑎 ∈ (1st𝐴) ∧ 𝑐 ∈ (2nd𝐴)) → 𝑎 <Q 𝑐))
1714, 16syl 14 . . . . . . . . . . . . . . 15 (𝐴P → ((𝑎 ∈ (1st𝐴) ∧ 𝑐 ∈ (2nd𝐴)) → 𝑎 <Q 𝑐))
18 prop 7465 . . . . . . . . . . . . . . . 16 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
19 prltlu 7477 . . . . . . . . . . . . . . . . 17 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝑏 ∈ (1st𝐵) ∧ 𝑑 ∈ (2nd𝐵)) → 𝑏 <Q 𝑑)
20193expib 1206 . . . . . . . . . . . . . . . 16 (⟨(1st𝐵), (2nd𝐵)⟩ ∈ P → ((𝑏 ∈ (1st𝐵) ∧ 𝑑 ∈ (2nd𝐵)) → 𝑏 <Q 𝑑))
2118, 20syl 14 . . . . . . . . . . . . . . 15 (𝐵P → ((𝑏 ∈ (1st𝐵) ∧ 𝑑 ∈ (2nd𝐵)) → 𝑏 <Q 𝑑))
2217, 21im2anan9 598 . . . . . . . . . . . . . 14 ((𝐴P𝐵P) → (((𝑎 ∈ (1st𝐴) ∧ 𝑐 ∈ (2nd𝐴)) ∧ (𝑏 ∈ (1st𝐵) ∧ 𝑑 ∈ (2nd𝐵))) → (𝑎 <Q 𝑐𝑏 <Q 𝑑)))
23 genpdisj.ord . . . . . . . . . . . . . . 15 ((𝑥Q𝑦Q𝑧Q) → (𝑥 <Q 𝑦 ↔ (𝑧𝐺𝑥) <Q (𝑧𝐺𝑦)))
24 genpdisj.com . . . . . . . . . . . . . . 15 ((𝑥Q𝑦Q) → (𝑥𝐺𝑦) = (𝑦𝐺𝑥))
2523, 24genplt2i 7500 . . . . . . . . . . . . . 14 ((𝑎 <Q 𝑐𝑏 <Q 𝑑) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
2622, 25syl6 33 . . . . . . . . . . . . 13 ((𝐴P𝐵P) → (((𝑎 ∈ (1st𝐴) ∧ 𝑐 ∈ (2nd𝐴)) ∧ (𝑏 ∈ (1st𝐵) ∧ 𝑑 ∈ (2nd𝐵))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑)))
2713, 26biimtrrid 153 . . . . . . . . . . . 12 ((𝐴P𝐵P) → (((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ (𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑)))
2827imp 124 . . . . . . . . . . 11 (((𝐴P𝐵P) ∧ ((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ (𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
2928adantlr 477 . . . . . . . . . 10 ((((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ ((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ (𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
3029adantrlr 485 . . . . . . . . 9 ((((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ (𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
3130adantrrr 487 . . . . . . . 8 ((((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
32 eqtr2 2196 . . . . . . . . . . 11 ((𝑞 = (𝑎𝐺𝑏) ∧ 𝑞 = (𝑐𝐺𝑑)) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
3332ad2ant2l 508 . . . . . . . . . 10 ((((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
3433adantl 277 . . . . . . . . 9 ((((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
35 ltsonq 7388 . . . . . . . . . . 11 <Q Or Q
36 ltrelnq 7355 . . . . . . . . . . 11 <Q ⊆ (Q × Q)
3735, 36soirri 5019 . . . . . . . . . 10 ¬ (𝑎𝐺𝑏) <Q (𝑎𝐺𝑏)
38 breq2 4004 . . . . . . . . . 10 ((𝑎𝐺𝑏) = (𝑐𝐺𝑑) → ((𝑎𝐺𝑏) <Q (𝑎𝐺𝑏) ↔ (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑)))
3937, 38mtbii 674 . . . . . . . . 9 ((𝑎𝐺𝑏) = (𝑐𝐺𝑑) → ¬ (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
4034, 39syl 14 . . . . . . . 8 ((((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → ¬ (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
4131, 40pm2.21fal 1373 . . . . . . 7 ((((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → ⊥)
4241ex 115 . . . . . 6 (((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → ((((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
4342exlimdvv 1897 . . . . 5 (((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → (∃𝑐𝑑(((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
4443exlimdvv 1897 . . . 4 (((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → (∃𝑎𝑏𝑐𝑑(((𝑎 ∈ (1st𝐴) ∧ 𝑏 ∈ (1st𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd𝐴) ∧ 𝑑 ∈ (2nd𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
4512, 44mpd 13 . . 3 (((𝐴P𝐵P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → ⊥)
4645inegd 1372 . 2 ((𝐴P𝐵P) → ¬ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))
4746ralrimivw 2551 1 ((𝐴P𝐵P) → ∀𝑞Q ¬ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  w3a 978   = wceq 1353  wfal 1358  wex 1492  wcel 2148  wral 2455  wrex 2456  {crab 2459  cop 3594   class class class wbr 4000  cfv 5212  (class class class)co 5869  cmpo 5871  1st c1st 6133  2nd c2nd 6134  Qcnq 7270   <Q cltq 7275  Pcnp 7281
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-eprel 4286  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-irdg 6365  df-oadd 6415  df-omul 6416  df-er 6529  df-ec 6531  df-qs 6535  df-ni 7294  df-mi 7296  df-lti 7297  df-enq 7337  df-nqqs 7338  df-ltnqqs 7343  df-inp 7456
This theorem is referenced by:  addclpr  7527  mulclpr  7562
  Copyright terms: Public domain W3C validator