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

Theorem prplnqu 7704
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 7631 . . . . . . . 8 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
31, 2syl 14 . . . . . . 7 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
4 prplnqu.x . . . . . . 7 (𝜑𝑋P)
5 ltaddpr 7681 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P𝑋P) → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋))
63, 4, 5syl2anc 411 . . . . . 6 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋))
7 addcomprg 7662 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P𝑋P) → (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
83, 4, 7syl2anc 411 . . . . . 6 (𝜑 → (⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
96, 8breqtrd 4060 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
10 prplnqu.sum . . . . . 6 (𝜑𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
11 addclpr 7621 . . . . . . . . 9 ((𝑋P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
124, 3, 11syl2anc 411 . . . . . . . 8 (𝜑 → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
13 prop 7559 . . . . . . . . 9 ((𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))⟩ ∈ P)
14 elprnqu 7566 . . . . . . . . 9 ((⟨(1st ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))⟩ ∈ P𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))) → 𝐴Q)
1513, 14sylan 283 . . . . . . . 8 (((𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))) → 𝐴Q)
1612, 10, 15syl2anc 411 . . . . . . 7 (𝜑𝐴Q)
17 nqpru 7636 . . . . . . 7 ((𝐴Q ∧ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P) → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
1816, 12, 17syl2anc 411 . . . . . 6 (𝜑 → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
1910, 18mpbid 147 . . . . 5 (𝜑 → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
20 ltsopr 7680 . . . . . 6 <P Or P
21 ltrelpr 7589 . . . . . 6 <P ⊆ (P × P)
2220, 21sotri 5066 . . . . 5 ((⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∧ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
239, 19, 22syl2anc 411 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
24 ltnqpr 7677 . . . . 5 ((𝑄Q𝐴Q) → (𝑄 <Q 𝐴 ↔ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
251, 16, 24syl2anc 411 . . . 4 (𝜑 → (𝑄 <Q 𝐴 ↔ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
2623, 25mpbird 167 . . 3 (𝜑𝑄 <Q 𝐴)
27 ltexnqi 7493 . . 3 (𝑄 <Q 𝐴 → ∃𝑧Q (𝑄 +Q 𝑧) = 𝐴)
2826, 27syl 14 . 2 (𝜑 → ∃𝑧Q (𝑄 +Q 𝑧) = 𝐴)
2919adantr 276 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
301adantr 276 . . . . . . . . . 10 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑄Q)
31 simprl 529 . . . . . . . . . 10 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧Q)
32 addcomnqg 7465 . . . . . . . . . 10 ((𝑄Q𝑧Q) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
3330, 31, 32syl2anc 411 . . . . . . . . 9 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
34 simprr 531 . . . . . . . . 9 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = 𝐴)
3533, 34eqtr3d 2231 . . . . . . . 8 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 +Q 𝑄) = 𝐴)
36 breq2 4038 . . . . . . . . . 10 ((𝑧 +Q 𝑄) = 𝐴 → (𝑙 <Q (𝑧 +Q 𝑄) ↔ 𝑙 <Q 𝐴))
3736abbidv 2314 . . . . . . . . 9 ((𝑧 +Q 𝑄) = 𝐴 → {𝑙𝑙 <Q (𝑧 +Q 𝑄)} = {𝑙𝑙 <Q 𝐴})
38 breq1 4037 . . . . . . . . . 10 ((𝑧 +Q 𝑄) = 𝐴 → ((𝑧 +Q 𝑄) <Q 𝑢𝐴 <Q 𝑢))
3938abbidv 2314 . . . . . . . . 9 ((𝑧 +Q 𝑄) = 𝐴 → {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢} = {𝑢𝐴 <Q 𝑢})
4037, 39opeq12d 3817 . . . . . . . 8 ((𝑧 +Q 𝑄) = 𝐴 → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
4135, 40syl 14 . . . . . . 7 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)
42 addnqpr 7645 . . . . . . . 8 ((𝑧Q𝑄Q) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4331, 30, 42syl2anc 411 . . . . . . 7 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4441, 43eqtr3d 2231 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
4529, 44breqtrd 4060 . . . . 5 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
46 ltaprg 7703 . . . . . . 7 ((𝑓P𝑔PP) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
4746adantl 277 . . . . . 6 (((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓P𝑔PP)) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
484adantr 276 . . . . . 6 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋P)
49 nqprlu 7631 . . . . . . 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 7662 . . . . . . 7 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
5352adantl 277 . . . . . 6 (((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
5447, 48, 50, 51, 53caovord2d 6097 . . . . 5 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ ↔ (𝑋 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
5545, 54mpbird 167 . . . 4 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩)
56 nqpru 7636 . . . . 5 ((𝑧Q𝑋P) → (𝑧 ∈ (2nd𝑋) ↔ 𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩))
5731, 48, 56syl2anc 411 . . . 4 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 ∈ (2nd𝑋) ↔ 𝑋<P ⟨{𝑙𝑙 <Q 𝑧}, {𝑢𝑧 <Q 𝑢}⟩))
5855, 57mpbird 167 . . 3 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ (2nd𝑋))
59 oveq1 5932 . . . . 5 (𝑦 = 𝑧 → (𝑦 +Q 𝑄) = (𝑧 +Q 𝑄))
6059eqeq1d 2205 . . . 4 (𝑦 = 𝑧 → ((𝑦 +Q 𝑄) = 𝐴 ↔ (𝑧 +Q 𝑄) = 𝐴))
6160rspcev 2868 . . 3 ((𝑧 ∈ (2nd𝑋) ∧ (𝑧 +Q 𝑄) = 𝐴) → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
6258, 35, 61syl2anc 411 . 2 ((𝜑 ∧ (𝑧Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
6328, 62rexlimddv 2619 1 (𝜑 → ∃𝑦 ∈ (2nd𝑋)(𝑦 +Q 𝑄) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wcel 2167  {cab 2182  wrex 2476  cop 3626   class class class wbr 4034  cfv 5259  (class class class)co 5925  1st c1st 6205  2nd c2nd 6206  Qcnq 7364   +Q cplq 7366   <Q cltq 7369  Pcnp 7375   +P cpp 7377  <P cltp 7379
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-eprel 4325  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-irdg 6437  df-1o 6483  df-2o 6484  df-oadd 6487  df-omul 6488  df-er 6601  df-ec 6603  df-qs 6607  df-ni 7388  df-pli 7389  df-mi 7390  df-lti 7391  df-plpq 7428  df-mpq 7429  df-enq 7431  df-nqqs 7432  df-plqqs 7433  df-mqqs 7434  df-1nqqs 7435  df-rq 7436  df-ltnqqs 7437  df-enq0 7508  df-nq0 7509  df-0nq0 7510  df-plq0 7511  df-mq0 7512  df-inp 7550  df-iplp 7552  df-iltp 7554
This theorem is referenced by:  caucvgprprlemexbt  7790
  Copyright terms: Public domain W3C validator