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

Theorem caucvgprlem2 6835
Description: Lemma for caucvgpr 6837. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 3-Oct-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 (𝐹𝑗))
caucvgpr.lim 𝐿 = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩
caucvgprlemlim.q (𝜑𝑄Q)
caucvgprlemlim.jk (𝜑𝐽 <N 𝐾)
caucvgprlemlim.jkq (𝜑 → (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑄)
Assertion
Ref Expression
caucvgprlem2 (𝜑𝐿<P ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩)
Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑢,𝑙   𝑛,𝐹,𝑘   𝑗,𝐾,𝑢,𝑙   𝑗,𝐿,𝑘   𝑄,𝑙,𝑢   𝑗,𝑙   𝑗,𝑘   𝑘,𝑛
Allowed substitution hints:   𝜑(𝑢,𝑗,𝑘,𝑛,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑙)   𝑄(𝑗,𝑘,𝑛)   𝐽(𝑢,𝑗,𝑘,𝑛,𝑙)   𝐾(𝑘,𝑛)   𝐿(𝑢,𝑛,𝑙)

Proof of Theorem caucvgprlem2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 caucvgprlemlim.jk . . . . 5 (𝜑𝐽 <N 𝐾)
2 caucvgprlemlim.jkq . . . . 5 (𝜑 → (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑄)
31, 2caucvgprlemk 6820 . . . 4 (𝜑 → (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ) <Q 𝑄)
4 caucvgpr.f . . . . 5 (𝜑𝐹:NQ)
5 ltrelpi 6479 . . . . . . . 8 <N ⊆ (N × N)
65brel 4419 . . . . . . 7 (𝐽 <N 𝐾 → (𝐽N𝐾N))
71, 6syl 14 . . . . . 6 (𝜑 → (𝐽N𝐾N))
87simprd 111 . . . . 5 (𝜑𝐾N)
94, 8ffvelrnd 5330 . . . 4 (𝜑 → (𝐹𝐾) ∈ Q)
10 ltanqi 6557 . . . 4 (((*Q‘[⟨𝐾, 1𝑜⟩] ~Q ) <Q 𝑄 ∧ (𝐹𝐾) ∈ Q) → ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄))
113, 9, 10syl2anc 397 . . 3 (𝜑 → ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄))
12 ltbtwnnqq 6570 . . 3 (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄) ↔ ∃𝑥Q (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))
1311, 12sylib 131 . 2 (𝜑 → ∃𝑥Q (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))
14 simprl 491 . . . 4 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝑥Q)
158adantr 265 . . . . . 6 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝐾N)
16 simprrl 499 . . . . . 6 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥)
17 fveq2 5205 . . . . . . . . 9 (𝑗 = 𝐾 → (𝐹𝑗) = (𝐹𝐾))
18 opeq1 3576 . . . . . . . . . . 11 (𝑗 = 𝐾 → ⟨𝑗, 1𝑜⟩ = ⟨𝐾, 1𝑜⟩)
1918eceq1d 6172 . . . . . . . . . 10 (𝑗 = 𝐾 → [⟨𝑗, 1𝑜⟩] ~Q = [⟨𝐾, 1𝑜⟩] ~Q )
2019fveq2d 5209 . . . . . . . . 9 (𝑗 = 𝐾 → (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) = (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ))
2117, 20oveq12d 5557 . . . . . . . 8 (𝑗 = 𝐾 → ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) = ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )))
2221breq1d 3801 . . . . . . 7 (𝑗 = 𝐾 → (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑥 ↔ ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥))
2322rspcev 2673 . . . . . 6 ((𝐾N ∧ ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑥)
2415, 16, 23syl2anc 397 . . . . 5 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑥)
25 breq2 3795 . . . . . . 7 (𝑢 = 𝑥 → (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑥))
2625rexbidv 2344 . . . . . 6 (𝑢 = 𝑥 → (∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑥))
27 caucvgpr.lim . . . . . . . 8 𝐿 = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩
2827fveq2i 5208 . . . . . . 7 (2nd𝐿) = (2nd ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩)
29 nqex 6518 . . . . . . . . 9 Q ∈ V
3029rabex 3928 . . . . . . . 8 {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)} ∈ V
3129rabex 3928 . . . . . . . 8 {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢} ∈ V
3230, 31op2nd 5801 . . . . . . 7 (2nd ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩) = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}
3328, 32eqtri 2076 . . . . . 6 (2nd𝐿) = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}
3426, 33elrab2 2722 . . . . 5 (𝑥 ∈ (2nd𝐿) ↔ (𝑥Q ∧ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑥))
3514, 24, 34sylanbrc 402 . . . 4 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝑥 ∈ (2nd𝐿))
36 simprrr 500 . . . . . 6 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝑥 <Q ((𝐹𝐾) +Q 𝑄))
37 vex 2577 . . . . . . 7 𝑥 ∈ V
38 breq1 3794 . . . . . . 7 (𝑙 = 𝑥 → (𝑙 <Q ((𝐹𝐾) +Q 𝑄) ↔ 𝑥 <Q ((𝐹𝐾) +Q 𝑄)))
3937, 38elab 2709 . . . . . 6 (𝑥 ∈ {𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)} ↔ 𝑥 <Q ((𝐹𝐾) +Q 𝑄))
4036, 39sylibr 141 . . . . 5 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝑥 ∈ {𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)})
41 ltnqex 6704 . . . . . 6 {𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)} ∈ V
42 gtnqex 6705 . . . . . 6 {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢} ∈ V
4341, 42op1st 5800 . . . . 5 (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩) = {𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}
4440, 43syl6eleqr 2147 . . . 4 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝑥 ∈ (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩))
45 rspe 2387 . . . 4 ((𝑥Q ∧ (𝑥 ∈ (2nd𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩))) → ∃𝑥Q (𝑥 ∈ (2nd𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩)))
4614, 35, 44, 45syl12anc 1144 . . 3 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → ∃𝑥Q (𝑥 ∈ (2nd𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩)))
47 caucvgpr.cau . . . . . 6 (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛) <Q ((𝐹𝑘) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
48 caucvgpr.bnd . . . . . 6 (𝜑 → ∀𝑗N 𝐴 <Q (𝐹𝑗))
494, 47, 48, 27caucvgprlemcl 6831 . . . . 5 (𝜑𝐿P)
5049adantr 265 . . . 4 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝐿P)
51 caucvgprlemlim.q . . . . . . 7 (𝜑𝑄Q)
52 addclnq 6530 . . . . . . 7 (((𝐹𝐾) ∈ Q𝑄Q) → ((𝐹𝐾) +Q 𝑄) ∈ Q)
539, 51, 52syl2anc 397 . . . . . 6 (𝜑 → ((𝐹𝐾) +Q 𝑄) ∈ Q)
54 nqprlu 6702 . . . . . 6 (((𝐹𝐾) +Q 𝑄) ∈ Q → ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩ ∈ P)
5553, 54syl 14 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩ ∈ P)
5655adantr 265 . . . 4 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩ ∈ P)
57 ltdfpr 6661 . . . 4 ((𝐿P ∧ ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩ ∈ P) → (𝐿<P ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩ ↔ ∃𝑥Q (𝑥 ∈ (2nd𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩))))
5850, 56, 57syl2anc 397 . . 3 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → (𝐿<P ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩ ↔ ∃𝑥Q (𝑥 ∈ (2nd𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩))))
5946, 58mpbird 160 . 2 ((𝜑 ∧ (𝑥Q ∧ (((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑥𝑥 <Q ((𝐹𝐾) +Q 𝑄)))) → 𝐿<P ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩)
6013, 59rexlimddv 2454 1 (𝜑𝐿<P ⟨{𝑙𝑙 <Q ((𝐹𝐾) +Q 𝑄)}, {𝑢 ∣ ((𝐹𝐾) +Q 𝑄) <Q 𝑢}⟩)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102   = wceq 1259  wcel 1409  {cab 2042  wral 2323  wrex 2324  {crab 2327  cop 3405   class class class wbr 3791  wf 4925  cfv 4929  (class class class)co 5539  1st c1st 5792  2nd c2nd 5793  1𝑜c1o 6024  [cec 6134  Ncnpi 6427   <N clti 6430   ~Q ceq 6434  Qcnq 6435   +Q cplq 6437  *Qcrq 6439   <Q cltq 6440  Pcnp 6446  <P cltp 6450
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-nul 3910  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-iinf 4338
This theorem depends on definitions:  df-bi 114  df-dc 754  df-3or 897  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-int 3643  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-tr 3882  df-eprel 4053  df-id 4057  df-po 4060  df-iso 4061  df-iord 4130  df-on 4132  df-suc 4135  df-iom 4341  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-ov 5542  df-oprab 5543  df-mpt2 5544  df-1st 5794  df-2nd 5795  df-recs 5950  df-irdg 5987  df-1o 6031  df-oadd 6035  df-omul 6036  df-er 6136  df-ec 6138  df-qs 6142  df-ni 6459  df-pli 6460  df-mi 6461  df-lti 6462  df-plpq 6499  df-mpq 6500  df-enq 6502  df-nqqs 6503  df-plqqs 6504  df-mqqs 6505  df-1nqqs 6506  df-rq 6507  df-ltnqqs 6508  df-inp 6621  df-iltp 6625
This theorem is referenced by:  caucvgprlemlim  6836
  Copyright terms: Public domain W3C validator