Theorem caucvgprlemlim 6779

Description: Lemma for caucvgpr 6780. 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‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
caucvgpr.bnd	⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
caucvgpr.lim	⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~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 6761	. . . 4 ⊢ (𝑥 ∈ Q → ∃𝑗 ∈ N (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥)
2	1	adantl 262	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → ∃𝑗 ∈ N (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥)
3		caucvgpr.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:N⟶Q)
4	3	ad5antr 465	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝐹:N⟶Q)
5		caucvgpr.cau	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
6	5	ad5antr 465	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
7		caucvgpr.bnd	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
8	7	ad5antr 465	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
9		caucvgpr.lim	. . . . . . . . 9 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩
10		simpr 103	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → 𝑥 ∈ Q)
11	10	ad4antr 463	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝑥 ∈ Q)
12		simpr 103	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝑗 <N 𝑘)
13		simpllr 486	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥)
14	4, 6, 8, 9, 11, 12, 13	caucvgprlem1 6777	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩))
15	4, 6, 8, 9, 11, 12, 13	caucvgprlem2 6778	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)
16	14, 15	jca 290	. . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) ∧ 𝑗 <N 𝑘) → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))
17	16	ex 108	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) ∧ 𝑘 ∈ N) → (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
18	17	ralrimiva 2392	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) ∧ (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥) → ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))
19	18	ex 108	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ Q) ∧ 𝑗 ∈ N) → ((*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) <Q 𝑥 → ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩))))
20	19	reximdva 2421	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ Q) → (∃𝑗 ∈ N (*Q‘[⟨𝑗, 1𝑜⟩] ~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 2392	1 ⊢ (𝜑 → ∀𝑥 ∈ Q ∃𝑗 ∈ N ∀𝑘 ∈ N (𝑗 <N 𝑘 → (⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑘)}, {𝑢 ∣ (𝐹‘𝑘) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑥}, {𝑢 ∣ 𝑥 <Q 𝑢}⟩) ∧ 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑘) +Q 𝑥)}, {𝑢 ∣ ((𝐹‘𝑘) +Q 𝑥) <Q 𝑢}⟩)))

Syntax hints:   → wi 4   ∧ wa 97   = wceq 1243   ∈ wcel 1393  {cab 2026  ∀wral 2306  ∃wrex 2307  {crab 2310  ⟨cop 3378   class class class wbr 3764  ⟶wf 4898  ‘cfv 4902  (class class class)co 5512  1_𝑜c1o 5994  [cec 6104  Ncnpi 6370   <_N clti 6373   ~_Q ceq 6377  Qcnq 6378   +_Q cplq 6380  *_Qcrq 6382   <_Q cltq 6383   +_P cpp 6391  <_P cltp 6393

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311

This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-2o 6002  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-rq 6450  df-ltnqqs 6451  df-enq0 6522  df-nq0 6523  df-0nq0 6524  df-plq0 6525  df-mq0 6526  df-inp 6564  df-iplp 6566  df-iltp 6568

This theorem is referenced by:  caucvgpr  6780