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

Theorem caucvgpr 7185
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 7165 and caucvgprpr 7215. Reading cauappcvgpr 7165 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‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~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‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
3 caucvgpr.bnd . . 3 (𝜑 → ∀𝑗N 𝐴 <Q (𝐹𝑗))
4 opeq1 3605 . . . . . . . . . . 11 (𝑧 = 𝑗 → ⟨𝑧, 1𝑜⟩ = ⟨𝑗, 1𝑜⟩)
54eceq1d 6280 . . . . . . . . . 10 (𝑧 = 𝑗 → [⟨𝑧, 1𝑜⟩] ~Q = [⟨𝑗, 1𝑜⟩] ~Q )
65fveq2d 5272 . . . . . . . . 9 (𝑧 = 𝑗 → (*Q‘[⟨𝑧, 1𝑜⟩] ~Q ) = (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ))
76oveq2d 5629 . . . . . . . 8 (𝑧 = 𝑗 → (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )))
8 fveq2 5268 . . . . . . . 8 (𝑧 = 𝑗 → (𝐹𝑧) = (𝐹𝑗))
97, 8breq12d 3833 . . . . . . 7 (𝑧 = 𝑗 → ((𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧) ↔ (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)))
109cbvrexv 2587 . . . . . 6 (∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧) ↔ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗))
1110a1i 9 . . . . 5 (𝑙Q → (∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧) ↔ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)))
1211rabbiia 2600 . . . 4 {𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)} = {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}
138, 6oveq12d 5631 . . . . . . . 8 (𝑧 = 𝑗 → ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) = ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )))
1413breq1d 3830 . . . . . . 7 (𝑧 = 𝑗 → (((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢))
1514cbvrexv 2587 . . . . . 6 (∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢)
1615a1i 9 . . . . 5 (𝑢Q → (∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢))
1716rabbiia 2600 . . . 4 {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢} = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}
1812, 17opeq12i 3610 . . 3 ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩
191, 2, 3, 18caucvgprlemcl 7179 . 2 (𝜑 → ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ ∈ P)
201, 2, 3, 18caucvgprlemlim 7184 . 2 (𝜑 → ∀𝑥Q𝑗N𝑘N (𝑗 <N 𝑘 → (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩)))
21 oveq1 5620 . . . . . . . 8 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ → (𝑦 +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) = (⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩))
2221breq2d 3832 . . . . . . 7 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ → (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ↔ ⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩)))
23 breq1 3823 . . . . . . 7 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ → (𝑦<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩ ↔ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩))
2422, 23anbi12d 457 . . . . . 6 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ → ((⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩) ↔ (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩)))
2524imbi2d 228 . . . . 5 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ → ((𝑗 <N 𝑘 → (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (𝑦 +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ 𝑦<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩)) ↔ (𝑗 <N 𝑘 → (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩))))
2625rexralbidv 2400 . . . 4 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~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‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩))))
2726ralbidv 2376 . . 3 (𝑦 = ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~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‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q ((𝐹𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹𝑘) +Q 𝑥) <Q 𝑢}⟩))))
2827rspcev 2715 . 2 ((⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ ∈ P ∧ ∀𝑥Q𝑗N𝑘N (𝑗 <N 𝑘 → (⟨{𝑙𝑙 <Q (𝐹𝑘)}, {𝑢 ∣ (𝐹𝑘) <Q 𝑢}⟩<P (⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑥}, {𝑢𝑥 <Q 𝑢}⟩) ∧ ⟨{𝑙Q ∣ ∃𝑧N (𝑙 +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~Q )) <Q (𝐹𝑧)}, {𝑢Q ∣ ∃𝑧N ((𝐹𝑧) +Q (*Q‘[⟨𝑧, 1𝑜⟩] ~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 403 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 102  wb 103   = wceq 1287  wcel 1436  {cab 2071  wral 2355  wrex 2356  {crab 2359  cop 3434   class class class wbr 3820  wf 4977  cfv 4981  (class class class)co 5613  1𝑜c1o 6128  [cec 6242  Ncnpi 6775   <N clti 6778   ~Q ceq 6782  Qcnq 6783   +Q cplq 6785  *Qcrq 6787   <Q cltq 6788  Pcnp 6794   +P cpp 6796  <P cltp 6798
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-13 1447  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-coll 3929  ax-sep 3932  ax-nul 3940  ax-pow 3984  ax-pr 4010  ax-un 4234  ax-setind 4326  ax-iinf 4376
This theorem depends on definitions:  df-bi 115  df-dc 779  df-3or 923  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ne 2252  df-ral 2360  df-rex 2361  df-reu 2362  df-rab 2364  df-v 2617  df-sbc 2830  df-csb 2923  df-dif 2990  df-un 2992  df-in 2994  df-ss 3001  df-nul 3276  df-pw 3417  df-sn 3437  df-pr 3438  df-op 3440  df-uni 3637  df-int 3672  df-iun 3715  df-br 3821  df-opab 3875  df-mpt 3876  df-tr 3912  df-eprel 4090  df-id 4094  df-po 4097  df-iso 4098  df-iord 4167  df-on 4169  df-suc 4172  df-iom 4379  df-xp 4417  df-rel 4418  df-cnv 4419  df-co 4420  df-dm 4421  df-rn 4422  df-res 4423  df-ima 4424  df-iota 4946  df-fun 4983  df-fn 4984  df-f 4985  df-f1 4986  df-fo 4987  df-f1o 4988  df-fv 4989  df-ov 5616  df-oprab 5617  df-mpt2 5618  df-1st 5868  df-2nd 5869  df-recs 6024  df-irdg 6089  df-1o 6135  df-2o 6136  df-oadd 6139  df-omul 6140  df-er 6244  df-ec 6246  df-qs 6250  df-ni 6807  df-pli 6808  df-mi 6809  df-lti 6810  df-plpq 6847  df-mpq 6848  df-enq 6850  df-nqqs 6851  df-plqqs 6852  df-mqqs 6853  df-1nqqs 6854  df-rq 6855  df-ltnqqs 6856  df-enq0 6927  df-nq0 6928  df-0nq0 6929  df-plq0 6930  df-mq0 6931  df-inp 6969  df-iplp 6971  df-iltp 6973
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator