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

Theorem caucvgpr 7815
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 7795 and caucvgprpr 7845. Reading cauappcvgpr 7795 first (the simplest of the three) might help understanding the other two.

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

Hypotheses
Ref Expression
caucvgpr.f (𝜑𝐹:NQ)
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.
StepHypRef Expression
1 caucvgpr.f . . 3 (𝜑𝐹:NQ)
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 3825 . . . . . . . . . . 11 (𝑧 = 𝑗 → ⟨𝑧, 1o⟩ = ⟨𝑗, 1o⟩)
54eceq1d 6669 . . . . . . . . . 10 (𝑧 = 𝑗 → [⟨𝑧, 1o⟩] ~Q = [⟨𝑗, 1o⟩] ~Q )
65fveq2d 5593 . . . . . . . . 9 (𝑧 = 𝑗 → (*Q‘[⟨𝑧, 1o⟩] ~Q ) = (*Q‘[⟨𝑗, 1o⟩] ~Q ))
76oveq2d 5973 . . . . . . . 8 (𝑧 = 𝑗 → (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
8 fveq2 5589 . . . . . . . 8 (𝑧 = 𝑗 → (𝐹𝑧) = (𝐹𝑗))
97, 8breq12d 4064 . . . . . . 7 (𝑧 = 𝑗 → ((𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹𝑧) ↔ (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
109cbvrexv 2740 . . . . . 6 (∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹𝑧) ↔ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗))
1110a1i 9 . . . . 5 (𝑙Q → (∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹𝑧) ↔ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
1211rabbiia 2758 . . . 4 {𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹𝑧)} = {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}
138, 6oveq12d 5975 . . . . . . . 8 (𝑧 = 𝑗 → ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) = ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
1413breq1d 4061 . . . . . . 7 (𝑧 = 𝑗 → (((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢))
1514cbvrexv 2740 . . . . . 6 (∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢)
1615a1i 9 . . . . 5 (𝑢Q → (∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢))
1716rabbiia 2758 . . . 4 {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢} = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
1812, 17opeq12i 3830 . . 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 𝑢}⟩
191, 2, 3, 18caucvgprlemcl 7809 . 2 (𝜑 → ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1o⟩] ~Q )) <Q 𝑢}⟩ ∈ P)
201, 2, 3, 18caucvgprlemlim 7814 . 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 5964 . . . . . . . 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 𝑢}⟩))
2221breq2d 4063 . . . . . . 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 4054 . . . . . . 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 𝑢}⟩))
2422, 23anbi12d 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 𝑢}⟩)))
2524imbi2d 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 𝑢}⟩))))
2625rexralbidv 2533 . . . 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 𝑢}⟩))))
2726ralbidv 2507 . . 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 𝑢}⟩))))
2827rspcev 2881 . 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 𝑢}⟩)))
2919, 20, 28syl2anc 411 1 (𝜑 → ∃𝑦P𝑥Q𝑗N𝑘N (𝑗 <N 𝑘 → (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2177  {cab 2192  wral 2485  wrex 2486  {crab 2489  cop 3641   class class class wbr 4051  wf 5276  cfv 5280  (class class class)co 5957  1oc1o 6508  [cec 6631  Ncnpi 7405   <N clti 7408   ~Q ceq 7412  Qcnq 7413   +Q cplq 7415  *Qcrq 7417   <Q cltq 7418  Pcnp 7424   +P cpp 7426  <P cltp 7428
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4167  ax-sep 4170  ax-nul 4178  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-iinf 4644
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-tr 4151  df-eprel 4344  df-id 4348  df-po 4351  df-iso 4352  df-iord 4421  df-on 4423  df-suc 4426  df-iom 4647  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-f1 5285  df-fo 5286  df-f1o 5287  df-fv 5288  df-ov 5960  df-oprab 5961  df-mpo 5962  df-1st 6239  df-2nd 6240  df-recs 6404  df-irdg 6469  df-1o 6515  df-2o 6516  df-oadd 6519  df-omul 6520  df-er 6633  df-ec 6635  df-qs 6639  df-ni 7437  df-pli 7438  df-mi 7439  df-lti 7440  df-plpq 7477  df-mpq 7478  df-enq 7480  df-nqqs 7481  df-plqqs 7482  df-mqqs 7483  df-1nqqs 7484  df-rq 7485  df-ltnqqs 7486  df-enq0 7557  df-nq0 7558  df-0nq0 7559  df-plq0 7560  df-mq0 7561  df-inp 7599  df-iplp 7601  df-iltp 7603
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator