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

Theorem caucvgprlemlol 7683
Description: Lemma for caucvgpr 7695. The lower cut of the putative limit is lower. (Contributed by Jim Kingdon, 20-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 𝑢}⟩
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.
StepHypRef Expression
1 ltrelnq 7378 . . . . 5 <Q ⊆ (Q × Q)
21brel 4690 . . . 4 (𝑠 <Q 𝑟 → (𝑠Q𝑟Q))
32simpld 112 . . 3 (𝑠 <Q 𝑟𝑠Q)
433ad2ant2 1020 . 2 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → 𝑠Q)
5 oveq1 5895 . . . . . . . 8 (𝑙 = 𝑟 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
65breq1d 4025 . . . . . . 7 (𝑙 = 𝑟 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗) ↔ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
76rexbidv 2488 . . . . . 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 𝑢}⟩
98fveq2i 5530 . . . . . . 7 (1st𝐿) = (1st ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
10 nqex 7376 . . . . . . . . 9 Q ∈ V
1110rabex 4159 . . . . . . . 8 {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)} ∈ V
1210rabex 4159 . . . . . . . 8 {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ V
1311, 12op1st 6161 . . . . . . 7 (1st ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩) = {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}
149, 13eqtri 2208 . . . . . 6 (1st𝐿) = {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}
157, 14elrab2 2908 . . . . 5 (𝑟 ∈ (1st𝐿) ↔ (𝑟Q ∧ ∃𝑗N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
1615simprbi 275 . . . 4 (𝑟 ∈ (1st𝐿) → ∃𝑗N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗))
17163ad2ant3 1021 . . 3 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → ∃𝑗N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗))
18 simpll2 1038 . . . . . . 7 ((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → 𝑠 <Q 𝑟)
19 ltanqg 7413 . . . . . . . . 9 ((𝑓Q𝑔QQ) → (𝑓 <Q 𝑔 ↔ ( +Q 𝑓) <Q ( +Q 𝑔)))
2019adantl 277 . . . . . . . 8 (((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) ∧ (𝑓Q𝑔QQ)) → (𝑓 <Q 𝑔 ↔ ( +Q 𝑓) <Q ( +Q 𝑔)))
214ad2antrr 488 . . . . . . . 8 ((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → 𝑠Q)
222simprd 114 . . . . . . . . . 10 (𝑠 <Q 𝑟𝑟Q)
23223ad2ant2 1020 . . . . . . . . 9 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → 𝑟Q)
2423ad2antrr 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 7435 . . . . . . . . 9 (𝑗N → [⟨𝑗, 1o⟩] ~QQ)
27 recclnq 7405 . . . . . . . . 9 ([⟨𝑗, 1o⟩] ~QQ → (*Q‘[⟨𝑗, 1o⟩] ~Q ) ∈ Q)
2825, 26, 273syl 17 . . . . . . . 8 ((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → (*Q‘[⟨𝑗, 1o⟩] ~Q ) ∈ Q)
29 addcomnqg 7394 . . . . . . . . 9 ((𝑓Q𝑔Q) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
3029adantl 277 . . . . . . . 8 (((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) ∧ (𝑓Q𝑔Q)) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
3120, 21, 24, 28, 30caovord2d 6058 . . . . . . 7 ((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → (𝑠 <Q 𝑟 ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q ))))
3218, 31mpbid 147 . . . . . 6 ((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
33 ltsonq 7411 . . . . . . 7 <Q Or Q
3433, 1sotri 5036 . . . . . 6 (((𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗))
3532, 34sylancom 420 . . . . 5 ((((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) ∧ (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗))
3635ex 115 . . . 4 (((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) ∧ 𝑗N) → ((𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗) → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
3736reximdva 2589 . . 3 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → (∃𝑗N (𝑟 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗) → ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
3817, 37mpd 13 . 2 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗))
39 oveq1 5895 . . . . 5 (𝑙 = 𝑠 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
4039breq1d 4025 . . . 4 (𝑙 = 𝑠 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
4140rexbidv 2488 . . 3 (𝑙 = 𝑠 → (∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗) ↔ ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
4241, 14elrab2 2908 . 2 (𝑠 ∈ (1st𝐿) ↔ (𝑠Q ∧ ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)))
434, 38, 42sylanbrc 417 1 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 979   = wceq 1363  wcel 2158  wral 2465  wrex 2466  {crab 2469  cop 3607   class class class wbr 4015  wf 5224  cfv 5228  (class class class)co 5888  1st c1st 6153  1oc1o 6424  [cec 6547  Ncnpi 7285   <N clti 7288   ~Q ceq 7292  Qcnq 7293   +Q cplq 7295  *Qcrq 7297   <Q cltq 7298
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-eprel 4301  df-id 4305  df-po 4308  df-iso 4309  df-iord 4378  df-on 4380  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6155  df-2nd 6156  df-recs 6320  df-irdg 6385  df-1o 6431  df-oadd 6435  df-omul 6436  df-er 6549  df-ec 6551  df-qs 6555  df-ni 7317  df-pli 7318  df-mi 7319  df-lti 7320  df-plpq 7357  df-mpq 7358  df-enq 7360  df-nqqs 7361  df-plqqs 7362  df-mqqs 7363  df-1nqqs 7364  df-rq 7365  df-ltnqqs 7366
This theorem is referenced by:  caucvgprlemrnd  7686
  Copyright terms: Public domain W3C validator