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

Theorem addnqprlemrl 7555
Description: Lemma for addnqpr 7559. The reverse subset relationship for the lower cut. (Contributed by Jim Kingdon, 19-Aug-2020.)
Assertion
Ref Expression
addnqprlemrl ((𝐴Q𝐵Q) → (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ⊆ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩))
Distinct variable groups:   𝐴,𝑙,𝑢   𝐵,𝑙,𝑢

Proof of Theorem addnqprlemrl
Dummy variables 𝑓 𝑔 𝑟 𝑠 𝑡 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nqprlu 7545 . . . . . 6 (𝐴Q → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P)
2 nqprlu 7545 . . . . . 6 (𝐵Q → ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩ ∈ P)
3 df-iplp 7466 . . . . . . 7 +P = (𝑥P, 𝑦P ↦ ⟨{𝑓Q ∣ ∃𝑔QQ (𝑔 ∈ (1st𝑥) ∧ ∈ (1st𝑦) ∧ 𝑓 = (𝑔 +Q ))}, {𝑓Q ∣ ∃𝑔QQ (𝑔 ∈ (2nd𝑥) ∧ ∈ (2nd𝑦) ∧ 𝑓 = (𝑔 +Q ))}⟩)
4 addclnq 7373 . . . . . . 7 ((𝑔QQ) → (𝑔 +Q ) ∈ Q)
53, 4genpelvl 7510 . . . . . 6 ((⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩ ∈ P) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ↔ ∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡)))
61, 2, 5syl2an 289 . . . . 5 ((𝐴Q𝐵Q) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ↔ ∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡)))
76biimpa 296 . . . 4 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → ∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡))
8 vex 2740 . . . . . . . . . . . . 13 𝑠 ∈ V
9 breq1 4006 . . . . . . . . . . . . 13 (𝑙 = 𝑠 → (𝑙 <Q 𝐴𝑠 <Q 𝐴))
10 ltnqex 7547 . . . . . . . . . . . . . 14 {𝑙𝑙 <Q 𝐴} ∈ V
11 gtnqex 7548 . . . . . . . . . . . . . 14 {𝑢𝐴 <Q 𝑢} ∈ V
1210, 11op1st 6146 . . . . . . . . . . . . 13 (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) = {𝑙𝑙 <Q 𝐴}
138, 9, 12elab2 2885 . . . . . . . . . . . 12 (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ↔ 𝑠 <Q 𝐴)
1413biimpi 120 . . . . . . . . . . 11 (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) → 𝑠 <Q 𝐴)
1514ad2antrl 490 . . . . . . . . . 10 ((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → 𝑠 <Q 𝐴)
1615adantr 276 . . . . . . . . 9 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑠 <Q 𝐴)
17 vex 2740 . . . . . . . . . . . . 13 𝑡 ∈ V
18 breq1 4006 . . . . . . . . . . . . 13 (𝑙 = 𝑡 → (𝑙 <Q 𝐵𝑡 <Q 𝐵))
19 ltnqex 7547 . . . . . . . . . . . . . 14 {𝑙𝑙 <Q 𝐵} ∈ V
20 gtnqex 7548 . . . . . . . . . . . . . 14 {𝑢𝐵 <Q 𝑢} ∈ V
2119, 20op1st 6146 . . . . . . . . . . . . 13 (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) = {𝑙𝑙 <Q 𝐵}
2217, 18, 21elab2 2885 . . . . . . . . . . . 12 (𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) ↔ 𝑡 <Q 𝐵)
2322biimpi 120 . . . . . . . . . . 11 (𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) → 𝑡 <Q 𝐵)
2423ad2antll 491 . . . . . . . . . 10 ((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → 𝑡 <Q 𝐵)
2524adantr 276 . . . . . . . . 9 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑡 <Q 𝐵)
26 ltrelnq 7363 . . . . . . . . . . . 12 <Q ⊆ (Q × Q)
2726brel 4678 . . . . . . . . . . 11 (𝑠 <Q 𝐴 → (𝑠Q𝐴Q))
2816, 27syl 14 . . . . . . . . . 10 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → (𝑠Q𝐴Q))
2926brel 4678 . . . . . . . . . . 11 (𝑡 <Q 𝐵 → (𝑡Q𝐵Q))
3025, 29syl 14 . . . . . . . . . 10 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → (𝑡Q𝐵Q))
31 lt2addnq 7402 . . . . . . . . . 10 (((𝑠Q𝐴Q) ∧ (𝑡Q𝐵Q)) → ((𝑠 <Q 𝐴𝑡 <Q 𝐵) → (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3228, 30, 31syl2anc 411 . . . . . . . . 9 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → ((𝑠 <Q 𝐴𝑡 <Q 𝐵) → (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3316, 25, 32mp2and 433 . . . . . . . 8 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵))
34 breq1 4006 . . . . . . . . 9 (𝑟 = (𝑠 +Q 𝑡) → (𝑟 <Q (𝐴 +Q 𝐵) ↔ (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3534adantl 277 . . . . . . . 8 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → (𝑟 <Q (𝐴 +Q 𝐵) ↔ (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3633, 35mpbird 167 . . . . . . 7 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑟 <Q (𝐴 +Q 𝐵))
37 vex 2740 . . . . . . . 8 𝑟 ∈ V
38 breq1 4006 . . . . . . . 8 (𝑙 = 𝑟 → (𝑙 <Q (𝐴 +Q 𝐵) ↔ 𝑟 <Q (𝐴 +Q 𝐵)))
39 ltnqex 7547 . . . . . . . . 9 {𝑙𝑙 <Q (𝐴 +Q 𝐵)} ∈ V
40 gtnqex 7548 . . . . . . . . 9 {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢} ∈ V
4139, 40op1st 6146 . . . . . . . 8 (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩) = {𝑙𝑙 <Q (𝐴 +Q 𝐵)}
4237, 38, 41elab2 2885 . . . . . . 7 (𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩) ↔ 𝑟 <Q (𝐴 +Q 𝐵))
4336, 42sylibr 134 . . . . . 6 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩))
4443ex 115 . . . . 5 ((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → (𝑟 = (𝑠 +Q 𝑡) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩)))
4544rexlimdvva 2602 . . . 4 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → (∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩)))
467, 45mpd 13 . . 3 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩))
4746ex 115 . 2 ((𝐴Q𝐵Q) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩)))
4847ssrdv 3161 1 ((𝐴Q𝐵Q) → (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ⊆ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1353  wcel 2148  {cab 2163  wrex 2456  wss 3129  cop 3595   class class class wbr 4003  cfv 5216  (class class class)co 5874  1st c1st 6138  Qcnq 7278   +Q cplq 7280   <Q cltq 7283  Pcnp 7289   +P cpp 7291
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 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536  ax-iinf 4587
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 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-eprel 4289  df-id 4293  df-po 4296  df-iso 4297  df-iord 4366  df-on 4368  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-recs 6305  df-irdg 6370  df-1o 6416  df-oadd 6420  df-omul 6421  df-er 6534  df-ec 6536  df-qs 6540  df-ni 7302  df-pli 7303  df-mi 7304  df-lti 7305  df-plpq 7342  df-mpq 7343  df-enq 7345  df-nqqs 7346  df-plqqs 7347  df-mqqs 7348  df-1nqqs 7349  df-rq 7350  df-ltnqqs 7351  df-inp 7464  df-iplp 7466
This theorem is referenced by:  addnqprlemfu  7558  addnqpr  7559
  Copyright terms: Public domain W3C validator