Theorem caucvgprprlemclphr 7646

Description: Lemma for caucvgprpr 7653. The putative limit is a positive real. Like caucvgprprlemcl 7645 but without a disjoint variable condition between 𝜑 and 𝑟. (Contributed by Jim Kingdon, 19-Jun-2021.)

Hypotheses

Ref	Expression
caucvgprpr.f	⊢ (𝜑 → 𝐹:N⟶P)
caucvgprpr.cau	⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
caucvgprpr.bnd	⊢ (𝜑 → ∀𝑚 ∈ N 𝐴<P (𝐹‘𝑚))
caucvgprpr.lim	⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩

Assertion

Ref	Expression
caucvgprprlemclphr	⊢ (𝜑 → 𝐿 ∈ P)

Distinct variable groups:   𝐴,𝑚   𝑚,𝐹   𝐴,𝑟   𝐹,𝑙,𝑢,𝑟,𝑘   𝑛,𝐹,𝑘   𝑘,𝐿   𝑢,𝑙,𝑝,𝑞,𝑟   𝑚,𝑟   𝑘,𝑝,𝑞,𝑟   𝑢,𝑛,𝑙,𝑘

Allowed substitution hints:   𝜑(𝑢,𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑞,𝑝,𝑙)   𝐹(𝑞,𝑝)   𝐿(𝑢,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem caucvgprprlemclphr

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caucvgprpr.f	. 2 ⊢ (𝜑 → 𝐹:N⟶P)
2		caucvgprpr.cau	. 2 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
3		caucvgprpr.bnd	. 2 ⊢ (𝜑 → ∀𝑚 ∈ N 𝐴<P (𝐹‘𝑚))
4		caucvgprpr.lim	. . 3 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩
5		opeq1 3758	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑠 → ⟨𝑟, 1o⟩ = ⟨𝑠, 1o⟩)
6	5	eceq1d 6537	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑠 → [⟨𝑟, 1o⟩] ~Q = [⟨𝑠, 1o⟩] ~Q )
7	6	fveq2d 5490	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑠 → (*Q‘[⟨𝑟, 1o⟩] ~Q ) = (*Q‘[⟨𝑠, 1o⟩] ~Q ))
8	7	oveq2d 5858	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑠 → (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )))
9	8	breq2d 3994	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → (𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) ↔ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))))
10	9	abbidv 2284	. . . . . . . . 9 ⊢ (𝑟 = 𝑠 → {𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))} = {𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))})
11	8	breq1d 3992	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → ((𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞 ↔ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞))
12	11	abbidv 2284	. . . . . . . . 9 ⊢ (𝑟 = 𝑠 → {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞} = {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞})
13	10, 12	opeq12d 3766	. . . . . . . 8 ⊢ (𝑟 = 𝑠 → ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩)
14		fveq2 5486	. . . . . . . 8 ⊢ (𝑟 = 𝑠 → (𝐹‘𝑟) = (𝐹‘𝑠))
15	13, 14	breq12d 3995	. . . . . . 7 ⊢ (𝑟 = 𝑠 → (⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑠)))
16	15	cbvrexv 2693	. . . . . 6 ⊢ (∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ∃𝑠 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑠))
17	16	a1i 9	. . . . 5 ⊢ (𝑙 ∈ Q → (∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ∃𝑠 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑠)))
18	17	rabbiia 2711	. . . 4 ⊢ {𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)} = {𝑙 ∈ Q ∣ ∃𝑠 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑠)}
19	7	breq2d 3994	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑠 → (𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q ) ↔ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )))
20	19	abbidv 2284	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → {𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )} = {𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )})
21	7	breq1d 3992	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑠 → ((*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞 ↔ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞))
22	21	abbidv 2284	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞} = {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞})
23	20, 22	opeq12d 3766	. . . . . . . . 9 ⊢ (𝑟 = 𝑠 → ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)
24	14, 23	oveq12d 5860	. . . . . . . 8 ⊢ (𝑟 = 𝑠 → ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩) = ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩))
25	24	breq1d 3992	. . . . . . 7 ⊢ (𝑟 = 𝑠 → (((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩ ↔ ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩))
26	25	cbvrexv 2693	. . . . . 6 ⊢ (∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩ ↔ ∃𝑠 ∈ N ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩)
27	26	a1i 9	. . . . 5 ⊢ (𝑢 ∈ Q → (∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩ ↔ ∃𝑠 ∈ N ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩))
28	27	rabbiia 2711	. . . 4 ⊢ {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩} = {𝑢 ∈ Q ∣ ∃𝑠 ∈ N ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}
29	18, 28	opeq12i 3763	. . 3 ⊢ ⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩ = ⟨{𝑙 ∈ Q ∣ ∃𝑠 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑠)}, {𝑢 ∈ Q ∣ ∃𝑠 ∈ N ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩
30	4, 29	eqtri 2186	. 2 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑠 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑠, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑠)}, {𝑢 ∈ Q ∣ ∃𝑠 ∈ N ((𝐹‘𝑠) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑠, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑠, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩
31	1, 2, 3, 30	caucvgprprlemcl 7645	1 ⊢ (𝜑 → 𝐿 ∈ P)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1343   ∈ wcel 2136  {cab 2151  ∀wral 2444  ∃wrex 2445  {crab 2448  ⟨cop 3579   class class class wbr 3982  ⟶wf 5184  ‘cfv 5188  (class class class)co 5842  1_oc1o 6377  [cec 6499  Ncnpi 7213   <_N clti 7216   ~_Q ceq 7220  Qcnq 7221   +_Q cplq 7223  *_Qcrq 7225   <_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  caucvgprprlemexb  7648