Theorem caucvgprlemlim 7748

Description: Lemma for caucvgpr 7749. The putative limit is a limit. (Contributed by Jim Kingdon, 1-Oct-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 (𝐹‘𝑗))
caucvgpr.lim	⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩

Assertion

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

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

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

Proof of Theorem caucvgprlemlim

Step	Hyp	Ref	Expression
1		archrecnq 7730	. . . 4 ⊢ (𝑥 ∈ Q → ∃𝑗 ∈ N (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥)
2	1	adantl 277	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → ∃𝑗 ∈ N (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥)
3		caucvgpr.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:N⟶Q)
4	3	ad5antr 496	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝐹:N⟶Q)
5		caucvgpr.cau	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
6	5	ad5antr 496	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
7		caucvgpr.bnd	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
8	7	ad5antr 496	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
9		caucvgpr.lim	. . . . . . . . 9 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
10		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → 𝑥 ∈ Q)
11	10	ad4antr 494	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝑥 ∈ Q)
12		simpr 110	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝑗 <N 𝑘)
13		simpllr 534	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥)
14	4, 6, 8, 9, 11, 12, 13	caucvgprlem1 7746	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩))
15	4, 6, 8, 9, 11, 12, 13	caucvgprlem2 7747	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)
16	14, 15	jca 306	. . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))
17	16	ex 115	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) → (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
18	17	ralrimiva 2570	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥) → ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
19	18	ex 115	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) → ((*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥 → ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))))
20	19	reximdva 2599	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → (∃𝑗 ∈ N (*Q‘[⟨𝑗, 1o⟩] ~Q ) <Q 𝑥 → ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))))
21	2, 20	mpd 13	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
22	21	ralrimiva 2570	1 ⊢ (𝜑 → ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2167  {cab 2182  ∀wral 2475  ∃wrex 2476  {crab 2479  ⟨cop 3625   class class class wbr 4033  ⟶wf 5254  ‘cfv 5258  (class class class)co 5922  1_oc1o 6467  [cec 6590  Ncnpi 7339   <_N clti 7342   ~_Q ceq 7346  Qcnq 7347   +_Q cplq 7349  *_Qcrq 7351   <_Q cltq 7352   +_P cpp 7360  <_P cltp 7362

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-eprel 4324  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-irdg 6428  df-1o 6474  df-2o 6475  df-oadd 6478  df-omul 6479  df-er 6592  df-ec 6594  df-qs 6598  df-ni 7371  df-pli 7372  df-mi 7373  df-lti 7374  df-plpq 7411  df-mpq 7412  df-enq 7414  df-nqqs 7415  df-plqqs 7416  df-mqqs 7417  df-1nqqs 7418  df-rq 7419  df-ltnqqs 7420  df-enq0 7491  df-nq0 7492  df-0nq0 7493  df-plq0 7494  df-mq0 7495  df-inp 7533  df-iplp 7535  df-iltp 7537

This theorem is referenced by:  caucvgpr  7749