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

Theorem caucvgprlem1 8046
Description: Lemma for caucvgpr 8049. 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‘[⟨𝑛, 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 𝑢}⟩
caucvgprlemlim.q (𝜑𝑄Q)
caucvgprlemlim.jk (𝜑𝐽 <N 𝐾)
caucvgprlemlim.jkq (𝜑 → (*Q‘[⟨𝐽, 1o⟩] ~Q ) <Q 𝑄)
Assertion
Ref Expression
caucvgprlem1 (𝜑 → ⟨{𝑙𝑙 <Q (𝐹𝐾)}, {𝑢 ∣ (𝐹𝐾) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑙,𝑢   𝑗,𝐾,𝑙,𝑢   𝑄,𝑗,𝑙,𝑢   𝑄,𝑘   𝑗,𝐿,𝑘   𝑢,𝑗   𝑘,𝐹,𝑛   𝑗,𝑘
Allowed substitution hints:   𝜑(𝑢, 𝑗, 𝑘, 𝑛, 𝑙)   𝐴(𝑢, 𝑘, 𝑛, 𝑙)   𝑄(𝑛)   𝐽(𝑢, 𝑗, 𝑘, 𝑛, 𝑙)   𝐾(𝑘, 𝑛)   𝐿(𝑢, 𝑛, 𝑙)

Proof of Theorem caucvgprlem1
StepHypRef Expression
1 caucvgprlemlim.jk . . . . . 6 (𝜑𝐽 <N 𝐾)
2 ltrelpi 7691 . . . . . . 7 <N ⊆ (N × N)
32brel 4827 . . . . . 6 (𝐽 <N 𝐾 → (𝐽N𝐾N))
41, 3syl 14 . . . . 5 (𝜑 → (𝐽N𝐾N))
54simprd 114 . . . 4 (𝜑𝐾N)
6 caucvgprlemlim.jkq . . . . . 6 (𝜑 → (*Q‘[⟨𝐽, 1o⟩] ~Q ) <Q 𝑄)
71, 6caucvgprlemk 8032 . . . . 5 (𝜑 → (*Q‘[⟨𝐾, 1o⟩] ~Q ) <Q 𝑄)
8 caucvgpr.f . . . . . 6 (𝜑𝐹:NQ)
98, 5ffvelcdmd 5844 . . . . 5 (𝜑 → (𝐹𝐾) ∈ Q)
10 ltanqi 7769 . . . . 5 (((*Q‘[⟨𝐾, 1o⟩] ~Q ) <Q 𝑄 ∧ (𝐹𝐾) ∈ Q) → ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄))
117, 9, 10syl2anc 415 . . . 4 (𝜑 → ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄))
12 opeq1 3904 . . . . . . . . 9 (𝑗 = 𝐾 → ⟨𝑗, 1o⟩ = ⟨𝐾, 1o⟩)
1312eceq1d 6843 . . . . . . . 8 (𝑗 = 𝐾 → [⟨𝑗, 1o⟩] ~Q = [⟨𝐾, 1o⟩] ~Q )
1413fveq2d 5699 . . . . . . 7 (𝑗 = 𝐾 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝐾, 1o⟩] ~Q ))
1514oveq2d 6101 . . . . . 6 (𝑗 = 𝐾 → ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )))
16 fveq2 5695 . . . . . . 7 (𝑗 = 𝐾 → (𝐹𝑗) = (𝐹𝐾))
1716oveq1d 6100 . . . . . 6 (𝑗 = 𝐾 → ((𝐹𝑗) +Q 𝑄) = ((𝐹𝐾) +Q 𝑄))
1815, 17breq12d 4143 . . . . 5 (𝑗 = 𝐾 → (((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄) ↔ ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄)))
1918rspcev 2929 . . . 4 ((𝐾N ∧ ((𝐹𝐾) +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q ((𝐹𝐾) +Q 𝑄)) → ∃𝑗N ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄))
205, 11, 19syl2anc 415 . . 3 (𝜑 → ∃𝑗N ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄))
21 oveq1 6092 . . . . . . . 8 (𝑙 = (𝐹𝐾) → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
2221breq1d 4140 . . . . . . 7 (𝑙 = (𝐹𝐾) → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄) ↔ ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)))
2322rexbidv 2551 . . . . . 6 (𝑙 = (𝐹𝐾) → (∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄) ↔ ∃𝑗N ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)))
2423elrab3 2983 . . . . 5 ((𝐹𝐾) ∈ Q → ((𝐹𝐾) ∈ {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)} ↔ ∃𝑗N ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)))
259, 24syl 14 . . . 4 (𝜑 → ((𝐹𝐾) ∈ {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)} ↔ ∃𝑗N ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)))
26 caucvgpr.cau . . . . . 6 (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛) <Q ((𝐹𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
27 caucvgpr.bnd . . . . . 6 (𝜑 → ∀𝑗N 𝐴 <Q (𝐹𝑗))
28 caucvgpr.lim . . . . . 6 𝐿 = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
29 caucvgprlemlim.q . . . . . 6 (𝜑𝑄Q)
308, 26, 27, 28, 29caucvgprlemladdrl 8045 . . . . 5 (𝜑 → {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)} ⊆ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
3130sseld 3247 . . . 4 (𝜑 → ((𝐹𝐾) ∈ {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄)} → (𝐹𝐾) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))))
3225, 31sylbird 170 . . 3 (𝜑 → (∃𝑗N ((𝐹𝐾) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q ((𝐹𝑗) +Q 𝑄) → (𝐹𝐾) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))))
3320, 32mpd 13 . 2 (𝜑 → (𝐹𝐾) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
348, 26, 27, 28caucvgprlemcl 8043 . . . 4 (𝜑𝐿P)
35 nqprlu 7914 . . . . 5 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
3629, 35syl 14 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
37 addclpr 7904 . . . 4 ((𝐿P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
3834, 36, 37syl2anc 415 . . 3 (𝜑 → (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P)
39 nqprl 7918 . . 3 (((𝐹𝐾) ∈ Q ∧ (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ∈ P) → ((𝐹𝐾) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)) ↔ ⟨{𝑙𝑙 <Q (𝐹𝐾)}, {𝑢 ∣ (𝐹𝐾) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
409, 38, 39syl2anc 415 . 2 (𝜑 → ((𝐹𝐾) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)) ↔ ⟨{𝑙𝑙 <Q (𝐹𝐾)}, {𝑢 ∣ (𝐹𝐾) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
4133, 40mpbid 147 1 (𝜑 → ⟨{𝑙𝑙 <Q (𝐹𝐾)}, {𝑢 ∣ (𝐹𝐾) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  {cab 2224  wral 2528  wrex 2529  {crab 2532  cop 3712   class class class wbr 4130  wf 5373  cfv 5377  (class class class)co 6085  1st c1st 6372  1oc1o 6680  [cec 6805  Ncnpi 7639   <N clti 7642   ~Q ceq 7646  Qcnq 7647   +Q cplq 7649  *Qcrq 7651   <Q cltq 7652  Pcnp 7658   +P cpp 7660  <P cltp 7662
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-iplp 7835  df-iltp 7837
This theorem is used by:  caucvgprlemlim  8048
  Copyright terms: Public domain W3C validator