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

Theorem addnqprlemrl 6712
Description: Lemma for addnqpr 6716. 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 6702 . . . . . 6 (𝐴Q → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P)
2 nqprlu 6702 . . . . . 6 (𝐵Q → ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩ ∈ P)
3 df-iplp 6623 . . . . . . 7 +P = (𝑥P, 𝑦P ↦ ⟨{𝑓Q ∣ ∃𝑔QQ (𝑔 ∈ (1st𝑥) ∧ ∈ (1st𝑦) ∧ 𝑓 = (𝑔 +Q ))}, {𝑓Q ∣ ∃𝑔QQ (𝑔 ∈ (2nd𝑥) ∧ ∈ (2nd𝑦) ∧ 𝑓 = (𝑔 +Q ))}⟩)
4 addclnq 6530 . . . . . . 7 ((𝑔QQ) → (𝑔 +Q ) ∈ Q)
53, 4genpelvl 6667 . . . . . 6 ((⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩ ∈ P) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ↔ ∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡)))
61, 2, 5syl2an 277 . . . . 5 ((𝐴Q𝐵Q) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ↔ ∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡)))
76biimpa 284 . . . 4 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → ∃𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩)∃𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)𝑟 = (𝑠 +Q 𝑡))
8 vex 2577 . . . . . . . . . . . . 13 𝑠 ∈ V
9 breq1 3794 . . . . . . . . . . . . 13 (𝑙 = 𝑠 → (𝑙 <Q 𝐴𝑠 <Q 𝐴))
10 ltnqex 6704 . . . . . . . . . . . . . 14 {𝑙𝑙 <Q 𝐴} ∈ V
11 gtnqex 6705 . . . . . . . . . . . . . 14 {𝑢𝐴 <Q 𝑢} ∈ V
1210, 11op1st 5800 . . . . . . . . . . . . 13 (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) = {𝑙𝑙 <Q 𝐴}
138, 9, 12elab2 2712 . . . . . . . . . . . 12 (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ↔ 𝑠 <Q 𝐴)
1413biimpi 117 . . . . . . . . . . 11 (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) → 𝑠 <Q 𝐴)
1514ad2antrl 467 . . . . . . . . . 10 ((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → 𝑠 <Q 𝐴)
1615adantr 265 . . . . . . . . 9 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑠 <Q 𝐴)
17 vex 2577 . . . . . . . . . . . . 13 𝑡 ∈ V
18 breq1 3794 . . . . . . . . . . . . 13 (𝑙 = 𝑡 → (𝑙 <Q 𝐵𝑡 <Q 𝐵))
19 ltnqex 6704 . . . . . . . . . . . . . 14 {𝑙𝑙 <Q 𝐵} ∈ V
20 gtnqex 6705 . . . . . . . . . . . . . 14 {𝑢𝐵 <Q 𝑢} ∈ V
2119, 20op1st 5800 . . . . . . . . . . . . 13 (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) = {𝑙𝑙 <Q 𝐵}
2217, 18, 21elab2 2712 . . . . . . . . . . . 12 (𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) ↔ 𝑡 <Q 𝐵)
2322biimpi 117 . . . . . . . . . . 11 (𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) → 𝑡 <Q 𝐵)
2423ad2antll 468 . . . . . . . . . 10 ((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → 𝑡 <Q 𝐵)
2524adantr 265 . . . . . . . . 9 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑡 <Q 𝐵)
26 ltrelnq 6520 . . . . . . . . . . . 12 <Q ⊆ (Q × Q)
2726brel 4419 . . . . . . . . . . 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 4419 . . . . . . . . . . 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 6559 . . . . . . . . . 10 (((𝑠Q𝐴Q) ∧ (𝑡Q𝐵Q)) → ((𝑠 <Q 𝐴𝑡 <Q 𝐵) → (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3228, 30, 31syl2anc 397 . . . . . . . . 9 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → ((𝑠 <Q 𝐴𝑡 <Q 𝐵) → (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3316, 25, 32mp2and 417 . . . . . . . 8 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵))
34 breq1 3794 . . . . . . . . 9 (𝑟 = (𝑠 +Q 𝑡) → (𝑟 <Q (𝐴 +Q 𝐵) ↔ (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3534adantl 266 . . . . . . . 8 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → (𝑟 <Q (𝐴 +Q 𝐵) ↔ (𝑠 +Q 𝑡) <Q (𝐴 +Q 𝐵)))
3633, 35mpbird 160 . . . . . . 7 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑟 <Q (𝐴 +Q 𝐵))
37 vex 2577 . . . . . . . 8 𝑟 ∈ V
38 breq1 3794 . . . . . . . 8 (𝑙 = 𝑟 → (𝑙 <Q (𝐴 +Q 𝐵) ↔ 𝑟 <Q (𝐴 +Q 𝐵)))
39 ltnqex 6704 . . . . . . . . 9 {𝑙𝑙 <Q (𝐴 +Q 𝐵)} ∈ V
40 gtnqex 6705 . . . . . . . . 9 {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢} ∈ V
4139, 40op1st 5800 . . . . . . . 8 (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩) = {𝑙𝑙 <Q (𝐴 +Q 𝐵)}
4237, 38, 41elab2 2712 . . . . . . 7 (𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩) ↔ 𝑟 <Q (𝐴 +Q 𝐵))
4336, 42sylibr 141 . . . . . 6 (((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ 𝑟 = (𝑠 +Q 𝑡)) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩))
4443ex 112 . . . . 5 ((((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) ∧ (𝑠 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑡 ∈ (1st ‘⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))) → (𝑟 = (𝑠 +Q 𝑡) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩)))
4544rexlimdvva 2457 . . . 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 112 . 2 ((𝐴Q𝐵Q) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) → 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 +Q 𝐵)}, {𝑢 ∣ (𝐴 +Q 𝐵) <Q 𝑢}⟩)))
4847ssrdv 2978 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 101  wb 102   = wceq 1259  wcel 1409  {cab 2042  wrex 2324  wss 2944  cop 3405   class class class wbr 3791  cfv 4929  (class class class)co 5539  1st c1st 5792  Qcnq 6435   +Q cplq 6437   <Q cltq 6440  Pcnp 6446   +P cpp 6448
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-nul 3910  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-iinf 4338
This theorem depends on definitions:  df-bi 114  df-dc 754  df-3or 897  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-int 3643  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-tr 3882  df-eprel 4053  df-id 4057  df-po 4060  df-iso 4061  df-iord 4130  df-on 4132  df-suc 4135  df-iom 4341  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-ov 5542  df-oprab 5543  df-mpt2 5544  df-1st 5794  df-2nd 5795  df-recs 5950  df-irdg 5987  df-1o 6031  df-oadd 6035  df-omul 6036  df-er 6136  df-ec 6138  df-qs 6142  df-ni 6459  df-pli 6460  df-mi 6461  df-lti 6462  df-plpq 6499  df-mpq 6500  df-enq 6502  df-nqqs 6503  df-plqqs 6504  df-mqqs 6505  df-1nqqs 6506  df-rq 6507  df-ltnqqs 6508  df-inp 6621  df-iplp 6623
This theorem is referenced by:  addnqprlemfu  6715  addnqpr  6716
  Copyright terms: Public domain W3C validator