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

Theorem prplnqu 7561
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 7488 . . . . . . . 8 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
31, 2syl 14 . . . . . . 7 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
4 prplnqu.x . . . . . . 7 (𝜑𝑋P)
5 ltaddpr 7538 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P𝑋P) → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋))
63, 4, 5syl2anc 409 . . . . . 6 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋))
7 addcomprg 7519 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P𝑋P) → (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
83, 4, 7syl2anc 409 . . . . . 6 (𝜑 → (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
96, 8breqtrd 4008 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
10 prplnqu.sum . . . . . 6 (𝜑𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
11 addclpr 7478 . . . . . . . . 9 ((𝑋P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
124, 3, 11syl2anc 409 . . . . . . . 8 (𝜑 → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
13 prop 7416 . . . . . . . . 9 ((𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))⟩ ∈ P)
14 elprnqu 7423 . . . . . . . . 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 7493 . . . . . . 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 7537 . . . . . 6 <P Or P
21 ltrelpr 7446 . . . . . 6 <P ⊆ (P × P)
2220, 21sotri 4999 . . . . 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 7534 . . . . 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 7350 . . 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 521 . . . . . . . . . 10 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧Q)
32 addcomnqg 7322 . . . . . . . . . 10 ((𝑄Q𝑧Q) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
3330, 31, 32syl2anc 409 . . . . . . . . 9 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
34 simprr 522 . . . . . . . . 9 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = 𝐴)
3533, 34eqtr3d 2200 . . . . . . . 8 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 +Q 𝑄) = 𝐴)
36 breq2 3986 . . . . . . . . . 10 ((𝑧 +Q 𝑄) = 𝐴 → (𝑙 <Q (𝑧 +Q 𝑄) ↔ 𝑙 <Q 𝐴))
3736abbidv 2284 . . . . . . . . 9 ((𝑧 +Q 𝑄) = 𝐴 → {𝑙𝑙 <Q (𝑧 +Q 𝑄)} = {𝑙𝑙 <Q 𝐴})
38 breq1 3985 . . . . . . . . . 10 ((𝑧 +Q 𝑄) = 𝐴 → ((𝑧 +Q 𝑄) <Q 𝑢𝐴 <Q 𝑢))
3938abbidv 2284 . . . . . . . . 9 ((𝑧 +Q 𝑄) = 𝐴 → {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢} = {𝑢𝐴 <Q 𝑢})
4037, 39opeq12d 3766 . . . . . . . 8 ((𝑧 +Q 𝑄) = 𝐴 → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
4135, 40syl 14 . . . . . . 7 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
42 addnqpr 7502 . . . . . . . 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 2200 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4529, 44breqtrd 4008 . . . . 5 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
46 ltaprg 7560 . . . . . . 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 7488 . . . . . . 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 7519 . . . . . . 7 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
5352adantl 275 . . . . . 6 (((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
5447, 48, 50, 51, 53caovord2d 6011 . . . . 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 7493 . . . . 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 5849 . . . . 5 (𝑦 = 𝑧 → (𝑦 +Q 𝑄) = (𝑧 +Q 𝑄))
6059eqeq1d 2174 . . . 4 (𝑦 = 𝑧 → ((𝑦 +Q 𝑄) = 𝐴 ↔ (𝑧 +Q 𝑄) = 𝐴))
6160rspcev 2830 . . 3 ((𝑧 ∈ (2nd𝑋) ∧ (𝑧 +Q 𝑄) = 𝐴) → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
6258, 35, 61syl2anc 409 . 2 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
6328, 62rexlimddv 2588 1 (𝜑 → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 968   = wceq 1343  wcel 2136  {cab 2151  wrex 2445  cop 3579   class class class wbr 3982  cfv 5188  (class class class)co 5842  1st c1st 6106  2nd c2nd 6107  Qcnq 7221   +Q cplq 7223   <Q cltq 7226  Pcnp 7232   +P cpp 7234  <P cltp 7236
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-eprel 4267  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-1o 6384  df-2o 6385  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-pli 7246  df-mi 7247  df-lti 7248  df-plpq 7285  df-mpq 7286  df-enq 7288  df-nqqs 7289  df-plqqs 7290  df-mqqs 7291  df-1nqqs 7292  df-rq 7293  df-ltnqqs 7294  df-enq0 7365  df-nq0 7366  df-0nq0 7367  df-plq0 7368  df-mq0 7369  df-inp 7407  df-iplp 7409  df-iltp 7411
This theorem is referenced by:  caucvgprprlemexbt  7647
  Copyright terms: Public domain W3C validator