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

Theorem prplnqu 7582
Description: Membership in the upper cut of a sum of a positive real and a fraction. (Contributed by Jim Kingdon, 16-Jun-2021.)
Hypotheses
Ref Expression
prplnqu.x (𝜑𝑋P)
prplnqu.q (𝜑𝑄Q)
prplnqu.sum (𝜑𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
Assertion
Ref Expression
prplnqu (𝜑 → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
Distinct variable groups:   𝐴,𝑙,𝑢   𝑦,𝐴   𝑄,𝑙,𝑢   𝑦,𝑄   𝑦,𝑋
Allowed substitution hints:   𝜑(𝑦,𝑢,𝑙)   𝑋(𝑢,𝑙)

Proof of Theorem prplnqu
Dummy variables 𝑓 𝑔 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prplnqu.q . . . . . . . 8 (𝜑𝑄Q)
2 nqprlu 7509 . . . . . . . 8 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
31, 2syl 14 . . . . . . 7 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
4 prplnqu.x . . . . . . 7 (𝜑𝑋P)
5 ltaddpr 7559 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P𝑋P) → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋))
63, 4, 5syl2anc 409 . . . . . 6 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋))
7 addcomprg 7540 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P𝑋P) → (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
83, 4, 7syl2anc 409 . . . . . 6 (𝜑 → (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
96, 8breqtrd 4015 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
10 prplnqu.sum . . . . . 6 (𝜑𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
11 addclpr 7499 . . . . . . . . 9 ((𝑋P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
124, 3, 11syl2anc 409 . . . . . . . 8 (𝜑 → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
13 prop 7437 . . . . . . . . 9 ((𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))⟩ ∈ P)
14 elprnqu 7444 . . . . . . . . 9 ((⟨(1st ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))⟩ ∈ P𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))) → 𝐴Q)
1513, 14sylan 281 . . . . . . . 8 (((𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))) → 𝐴Q)
1612, 10, 15syl2anc 409 . . . . . . 7 (𝜑𝐴Q)
17 nqpru 7514 . . . . . . 7 ((𝐴Q ∧ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P) → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
1816, 12, 17syl2anc 409 . . . . . 6 (𝜑 → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
1910, 18mpbid 146 . . . . 5 (𝜑 → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
20 ltsopr 7558 . . . . . 6 <P Or P
21 ltrelpr 7467 . . . . . 6 <P ⊆ (P × P)
2220, 21sotri 5006 . . . . 5 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∧ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
239, 19, 22syl2anc 409 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
24 ltnqpr 7555 . . . . 5 ((𝑄Q𝐴Q) → (𝑄 <Q 𝐴 ↔ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
251, 16, 24syl2anc 409 . . . 4 (𝜑 → (𝑄 <Q 𝐴 ↔ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
2623, 25mpbird 166 . . 3 (𝜑𝑄 <Q 𝐴)
27 ltexnqi 7371 . . 3 (𝑄 <Q 𝐴 → ∃𝑧Q (𝑄 +Q 𝑧) = 𝐴)
2826, 27syl 14 . 2 (𝜑 → ∃𝑧Q (𝑄 +Q 𝑧) = 𝐴)
2919adantr 274 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
301adantr 274 . . . . . . . . . 10 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑄Q)
31 simprl 526 . . . . . . . . . 10 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧Q)
32 addcomnqg 7343 . . . . . . . . . 10 ((𝑄Q𝑧Q) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
3330, 31, 32syl2anc 409 . . . . . . . . 9 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
34 simprr 527 . . . . . . . . 9 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = 𝐴)
3533, 34eqtr3d 2205 . . . . . . . 8 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 +Q 𝑄) = 𝐴)
36 breq2 3993 . . . . . . . . . 10 ((𝑧 +Q 𝑄) = 𝐴 → (𝑙 <Q (𝑧 +Q 𝑄) ↔ 𝑙 <Q 𝐴))
3736abbidv 2288 . . . . . . . . 9 ((𝑧 +Q 𝑄) = 𝐴 → {𝑙𝑙 <Q (𝑧 +Q 𝑄)} = {𝑙𝑙 <Q 𝐴})
38 breq1 3992 . . . . . . . . . 10 ((𝑧 +Q 𝑄) = 𝐴 → ((𝑧 +Q 𝑄) <Q 𝑢𝐴 <Q 𝑢))
3938abbidv 2288 . . . . . . . . 9 ((𝑧 +Q 𝑄) = 𝐴 → {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢} = {𝑢𝐴 <Q 𝑢})
4037, 39opeq12d 3773 . . . . . . . 8 ((𝑧 +Q 𝑄) = 𝐴 → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
4135, 40syl 14 . . . . . . 7 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
42 addnqpr 7523 . . . . . . . 8 ((𝑧Q𝑄Q) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4331, 30, 42syl2anc 409 . . . . . . 7 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4441, 43eqtr3d 2205 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4529, 44breqtrd 4015 . . . . 5 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
46 ltaprg 7581 . . . . . . 7 ((𝑓P𝑔PP) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
4746adantl 275 . . . . . 6 (((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓P𝑔PP)) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
484adantr 274 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋P)
49 nqprlu 7509 . . . . . . 7 (𝑧Q → ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ ∈ P)
5031, 49syl 14 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ ∈ P)
5130, 2syl 14 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
52 addcomprg 7540 . . . . . . 7 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
5352adantl 275 . . . . . 6 (((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
5447, 48, 50, 51, 53caovord2d 6022 . . . . 5 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ ↔ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
5545, 54mpbird 166 . . . 4 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩)
56 nqpru 7514 . . . . 5 ((𝑧Q𝑋P) → (𝑧 ∈ (2nd𝑋) ↔ 𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩))
5731, 48, 56syl2anc 409 . . . 4 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 ∈ (2nd𝑋) ↔ 𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩))
5855, 57mpbird 166 . . 3 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ (2nd𝑋))
59 oveq1 5860 . . . . 5 (𝑦 = 𝑧 → (𝑦 +Q 𝑄) = (𝑧 +Q 𝑄))
6059eqeq1d 2179 . . . 4 (𝑦 = 𝑧 → ((𝑦 +Q 𝑄) = 𝐴 ↔ (𝑧 +Q 𝑄) = 𝐴))
6160rspcev 2834 . . 3 ((𝑧 ∈ (2nd𝑋) ∧ (𝑧 +Q 𝑄) = 𝐴) → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
6258, 35, 61syl2anc 409 . 2 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
6328, 62rexlimddv 2592 1 (𝜑 → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 973   = wceq 1348  wcel 2141  {cab 2156  wrex 2449  cop 3586   class class class wbr 3989  cfv 5198  (class class class)co 5853  1st c1st 6117  2nd c2nd 6118  Qcnq 7242   +Q cplq 7244   <Q cltq 7247  Pcnp 7253   +P cpp 7255  <P cltp 7257
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-eprel 4274  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-irdg 6349  df-1o 6395  df-2o 6396  df-oadd 6399  df-omul 6400  df-er 6513  df-ec 6515  df-qs 6519  df-ni 7266  df-pli 7267  df-mi 7268  df-lti 7269  df-plpq 7306  df-mpq 7307  df-enq 7309  df-nqqs 7310  df-plqqs 7311  df-mqqs 7312  df-1nqqs 7313  df-rq 7314  df-ltnqqs 7315  df-enq0 7386  df-nq0 7387  df-0nq0 7388  df-plq0 7389  df-mq0 7390  df-inp 7428  df-iplp 7430  df-iltp 7432
This theorem is referenced by:  caucvgprprlemexbt  7668
  Copyright terms: Public domain W3C validator