Theorem caucvgpr 7902

Description: A Cauchy sequence of positive fractions with a modulus of convergence converges to a positive real. This is basically Corollary 11.2.13 of [HoTT], p. (varies) (one key difference being that this is for positive reals rather than signed reals). Also, the HoTT book theorem has a modulus of convergence (that is, a rate of convergence) specified by (11.2.9) in HoTT whereas this theorem fixes the rate of convergence to say that all terms after the nth term must be within 1 / 𝑛 of the nth term (it should later be able to prove versions of this theorem with a different fixed rate or a modulus of convergence supplied as a hypothesis). We also specify that every term needs to be larger than a fraction 𝐴, to avoid the case where we have positive terms which "converge" to zero (which is not a positive real).

This proof (including its lemmas) is similar to the proofs of cauappcvgpr 7882 and caucvgprpr 7932. Reading cauappcvgpr 7882 first (the simplest of the three) might help understanding the other two.

(Contributed by Jim Kingdon, 18-Jun-2020.)

Hypotheses

Ref	Expression
caucvgpr.f	⊢ (𝜑 → 𝐹:N⟶Q)
caucvgpr.cau	⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
caucvgpr.bnd	⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))

Assertion

Ref	Expression
caucvgpr	⊢ (𝜑 → ∃𝑦 ∈ P ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))

Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑘,𝑛,𝑙,𝑢,𝑥,𝑦   𝜑,𝑗,𝑘,𝑥

Allowed substitution hints:   𝜑(𝑦,𝑢,𝑛,𝑙)   𝐴(𝑥,𝑦,𝑢,𝑘,𝑛,𝑙)

Proof of Theorem caucvgpr

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caucvgpr.f	. . 3 ⊢ (𝜑 → 𝐹:N⟶Q)
2		caucvgpr.cau	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
3		caucvgpr.bnd	. . 3 ⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
4		opeq1 3862	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑗 → ⟨𝑧, 1o⟩ = ⟨𝑗, 1o⟩)
5	4	eceq1d 6738	. . . . . . . . . 10 ⊢ (𝑧 = 𝑗 → [⟨𝑧, 1o⟩] ~Q = [⟨𝑗, 1o⟩] ~Q )
6	5	fveq2d 5643	. . . . . . . . 9 ⊢ (𝑧 = 𝑗 → (*Q‘[⟨𝑧, 1o⟩] ~Q ) = (*Q‘[⟨𝑗, 1o⟩] ~Q ))
7	6	oveq2d 6034	. . . . . . . 8 ⊢ (𝑧 = 𝑗 → (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
8		fveq2 5639	. . . . . . . 8 ⊢ (𝑧 = 𝑗 → (𝐹‘𝑧) = (𝐹‘𝑗))
9	7, 8	breq12d 4101	. . . . . . 7 ⊢ (𝑧 = 𝑗 → ((𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧) ↔ (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
10	9	cbvrexv 2768	. . . . . 6 ⊢ (∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧) ↔ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
11	10	a1i 9	. . . . 5 ⊢ (𝑙 ∈ Q → (∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧) ↔ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
12	11	rabbiia 2788	. . . 4 ⊢ {𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)} = {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}
13	8, 6	oveq12d 6036	. . . . . . . 8 ⊢ (𝑧 = 𝑗 → ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) = ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
14	13	breq1d 4098	. . . . . . 7 ⊢ (𝑧 = 𝑗 → (((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢))
15	14	cbvrexv 2768	. . . . . 6 ⊢ (∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢)
16	15	a1i 9	. . . . 5 ⊢ (𝑢 ∈ Q → (∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢))
17	16	rabbiia 2788	. . . 4 ⊢ {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢} = {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
18	12, 17	opeq12i 3867	. . 3 ⊢ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
19	1, 2, 3, 18	caucvgprlemcl 7896	. 2 ⊢ (𝜑 → ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ ∈ P)
20	1, 2, 3, 18	caucvgprlemlim 7901	. 2 ⊢ (𝜑 → ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
21		oveq1 6025	. . . . . . . 8 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) = (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩))
22	21	breq2d 4100	. . . . . . 7 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ↔ ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩)))
23		breq1 4091	. . . . . . 7 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → (𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩ ↔ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))
24	22, 23	anbi12d 473	. . . . . 6 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → ((⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩) ↔ (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
25	24	imbi2d 230	. . . . 5 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → ((𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)) ↔ (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))))
26	25	rexralbidv 2558	. . . 4 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → (∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)) ↔ ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))))
27	26	ralbidv 2532	. . 3 ⊢ (𝑦 = ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ → (∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)) ↔ ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))))
28	27	rspcev 2910	. 2 ⊢ ((⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ ∈ P ∧ ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙 ∈ Q ∣ ∃𝑧 ∈ N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹‘𝑧)}, {𝑢 ∈ Q ∣ ∃𝑧 ∈ N ((𝐹‘𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))) → ∃𝑦 ∈ P ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
29	19, 20, 28	syl2anc 411	1 ⊢ (𝜑 → ∃𝑦 ∈ P ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202  {cab 2217  ∀wral 2510  ∃wrex 2511  {crab 2514  ⟨cop 3672   class class class wbr 4088  ⟶wf 5322  ‘cfv 5326  (class class class)co 6018  1_oc1o 6575  [cec 6700  Ncnpi 7492   <_N clti 7495   ~_Q ceq 7499  Qcnq 7500   +_Q cplq 7502  *_Qcrq 7504   <_Q cltq 7505  Pcnp 7511   +_P cpp 7513  <_P cltp 7515

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-1o 6582  df-2o 6583  df-oadd 6586  df-omul 6587  df-er 6702  df-ec 6704  df-qs 6708  df-ni 7524  df-pli 7525  df-mi 7526  df-lti 7527  df-plpq 7564  df-mpq 7565  df-enq 7567  df-nqqs 7568  df-plqqs 7569  df-mqqs 7570  df-1nqqs 7571  df-rq 7572  df-ltnqqs 7573  df-enq0 7644  df-nq0 7645  df-0nq0 7646  df-plq0 7647  df-mq0 7648  df-inp 7686  df-iplp 7688  df-iltp 7690

This theorem is referenced by: (None)