Theorem caucvgprlemlol 7669

Description: Lemma for caucvgpr 7681. The lower cut of the putative limit is lower. (Contributed by Jim Kingdon, 20-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
caucvgprlemlol	⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → 𝑠 ∈ (1st ‘𝐿))

Distinct variable groups:   𝐴,𝑗   𝐹,𝑙,𝑟,𝑠   𝑢,𝐹   𝑗,𝐿,𝑟,𝑠   𝑗,𝑙,𝑠   𝜑,𝑗,𝑟,𝑠   𝑢,𝑗,𝑟,𝑠

Allowed substitution hints:   𝜑(𝑢,𝑘,𝑛,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑠,𝑟,𝑙)   𝐹(𝑗,𝑘,𝑛)   𝐿(𝑢,𝑘,𝑛,𝑙)

Proof of Theorem caucvgprlemlol

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltrelnq 7364	. . . . 5 ⊢ <Q ⊆ (Q × Q)
2	1	brel 4679	. . . 4 ⊢ (𝑠 <Q 𝑟 → (𝑠 ∈ Q ∧ 𝑟 ∈ Q))
3	2	simpld 112	. . 3 ⊢ (𝑠 <Q 𝑟 → 𝑠 ∈ Q)
4	3	3ad2ant2 1019	. 2 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → 𝑠 ∈ Q)
5		oveq1 5882	. . . . . . . 8 ⊢ (𝑙 = 𝑟 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
6	5	breq1d 4014	. . . . . . 7 ⊢ (𝑙 = 𝑟 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
7	6	rexbidv 2478	. . . . . 6 ⊢ (𝑙 = 𝑟 → (∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ ∃𝑗 ∈ N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
8		caucvgpr.lim	. . . . . . . 8 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
9	8	fveq2i 5519	. . . . . . 7 ⊢ (1st ‘𝐿) = (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
10		nqex 7362	. . . . . . . . 9 ⊢ Q ∈ V
11	10	rabex 4148	. . . . . . . 8 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ V
12	10	rabex 4148	. . . . . . . 8 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ V
13	11, 12	op1st 6147	. . . . . . 7 ⊢ (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩) = {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}
14	9, 13	eqtri 2198	. . . . . 6 ⊢ (1st ‘𝐿) = {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}
15	7, 14	elrab2 2897	. . . . 5 ⊢ (𝑟 ∈ (1st ‘𝐿) ↔ (𝑟 ∈ Q ∧ ∃𝑗 ∈ N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
16	15	simprbi 275	. . . 4 ⊢ (𝑟 ∈ (1st ‘𝐿) → ∃𝑗 ∈ N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
17	16	3ad2ant3 1020	. . 3 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → ∃𝑗 ∈ N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
18		simpll2 1037	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → 𝑠 <Q 𝑟)
19		ltanqg 7399	. . . . . . . . 9 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑓 <Q 𝑔 ↔ (ℎ +Q 𝑓) <Q (ℎ +Q 𝑔)))
20	19	adantl 277	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → (𝑓 <Q 𝑔 ↔ (ℎ +Q 𝑓) <Q (ℎ +Q 𝑔)))
21	4	ad2antrr 488	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → 𝑠 ∈ Q)
22	2	simprd 114	. . . . . . . . . 10 ⊢ (𝑠 <Q 𝑟 → 𝑟 ∈ Q)
23	22	3ad2ant2 1019	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → 𝑟 ∈ Q)
24	23	ad2antrr 488	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → 𝑟 ∈ Q)
25		simplr 528	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → 𝑗 ∈ N)
26		nnnq 7421	. . . . . . . . 9 ⊢ (𝑗 ∈ N → [⟨𝑗, 1o⟩] ~Q ∈ Q)
27		recclnq 7391	. . . . . . . . 9 ⊢ ([⟨𝑗, 1o⟩] ~Q ∈ Q → (*Q‘[⟨𝑗, 1o⟩] ~Q ) ∈ Q)
28	25, 26, 27	3syl 17	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → (*Q‘[⟨𝑗, 1o⟩] ~Q ) ∈ Q)
29		addcomnqg 7380	. . . . . . . . 9 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
30	29	adantl 277	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q)) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
31	20, 21, 24, 28, 30	caovord2d 6044	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → (𝑠 <Q 𝑟 ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q ))))
32	18, 31	mpbid 147	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
33		ltsonq 7397	. . . . . . 7 ⊢ <Q Or Q
34	33, 1	sotri 5025	. . . . . 6 ⊢ (((𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
35	32, 34	sylancom 420	. . . . 5 ⊢ ((((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
36	35	ex 115	. . . 4 ⊢ (((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) ∧ 𝑗 ∈ N) → ((𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
37	36	reximdva 2579	. . 3 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → (∃𝑗 ∈ N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) → ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
38	17, 37	mpd 13	. 2 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
39		oveq1 5882	. . . . 5 ⊢ (𝑙 = 𝑠 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
40	39	breq1d 4014	. . . 4 ⊢ (𝑙 = 𝑠 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
41	40	rexbidv 2478	. . 3 ⊢ (𝑙 = 𝑠 → (∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
42	41, 14	elrab2 2897	. 2 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
43	4, 38, 42	sylanbrc 417	1 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿)) → 𝑠 ∈ (1st ‘𝐿))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 978   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  {crab 2459  ⟨cop 3596   class class class wbr 4004  ⟶wf 5213  ‘cfv 5217  (class class class)co 5875  1^st c1st 6139  1_oc1o 6410  [cec 6533  Ncnpi 7271   <_N clti 7274   ~_Q ceq 7278  Qcnq 7279   +_Q cplq 7281  *_Qcrq 7283   <_Q cltq 7284

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-nul 4130  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-iinf 4588

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-tr 4103  df-eprel 4290  df-id 4294  df-po 4297  df-iso 4298  df-iord 4367  df-on 4369  df-suc 4372  df-iom 4591  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-ov 5878  df-oprab 5879  df-mpo 5880  df-1st 6141  df-2nd 6142  df-recs 6306  df-irdg 6371  df-1o 6417  df-oadd 6421  df-omul 6422  df-er 6535  df-ec 6537  df-qs 6541  df-ni 7303  df-pli 7304  df-mi 7305  df-lti 7306  df-plpq 7343  df-mpq 7344  df-enq 7346  df-nqqs 7347  df-plqqs 7348  df-mqqs 7349  df-1nqqs 7350  df-rq 7351  df-ltnqqs 7352

This theorem is referenced by:  caucvgprlemrnd  7672