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

Theorem caucvgprprlemrnd 7821
Description: Lemma for caucvgprpr 7832. The putative limit is rounded. (Contributed by Jim Kingdon, 21-Dec-2020.)
Hypotheses
Ref Expression
caucvgprpr.f (𝜑𝐹:NP)
caucvgprpr.cau (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛)<P ((𝐹𝑘) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹𝑘)<P ((𝐹𝑛) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
caucvgprpr.bnd (𝜑 → ∀𝑚N 𝐴<P (𝐹𝑚))
caucvgprpr.lim 𝐿 = ⟨{𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)}, {𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩}⟩
Assertion
Ref Expression
caucvgprprlemrnd (𝜑 → (∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))) ∧ ∀𝑡Q (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)))))
Distinct variable groups:   𝐴,𝑚   𝑚,𝐹   𝐹,𝑙,𝑡   𝑢,𝐹,𝑡,𝑟,𝑠   𝐿,𝑠,𝑡   𝑝,𝑙,𝑞,𝑟,𝑠,𝑡   𝑢,𝑝,𝑞,𝑟,𝑠   𝜑,𝑟,𝑠,𝑡
Allowed substitution hints:   𝜑(𝑢,𝑘,𝑚,𝑛,𝑞,𝑝,𝑙)   𝐴(𝑢,𝑡,𝑘,𝑛,𝑠,𝑟,𝑞,𝑝,𝑙)   𝐹(𝑘,𝑛,𝑞,𝑝)   𝐿(𝑢,𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem caucvgprprlemrnd
StepHypRef Expression
1 caucvgprpr.f . . . . . 6 (𝜑𝐹:NP)
2 caucvgprpr.cau . . . . . 6 (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛)<P ((𝐹𝑘) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹𝑘)<P ((𝐹𝑛) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
3 caucvgprpr.bnd . . . . . 6 (𝜑 → ∀𝑚N 𝐴<P (𝐹𝑚))
4 caucvgprpr.lim . . . . . 6 𝐿 = ⟨{𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)}, {𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩}⟩
51, 2, 3, 4caucvgprprlemopl 7817 . . . . 5 ((𝜑𝑠 ∈ (1st𝐿)) → ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿)))
65ex 115 . . . 4 (𝜑 → (𝑠 ∈ (1st𝐿) → ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))))
71, 2, 3, 4caucvgprprlemlol 7818 . . . . . 6 ((𝜑𝑠 <Q 𝑡𝑡 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿))
873expib 1209 . . . . 5 (𝜑 → ((𝑠 <Q 𝑡𝑡 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿)))
98rexlimdvw 2628 . . . 4 (𝜑 → (∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿)))
106, 9impbid 129 . . 3 (𝜑 → (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))))
1110ralrimivw 2581 . 2 (𝜑 → ∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))))
121, 2, 3, 4caucvgprprlemopu 7819 . . . . 5 ((𝜑𝑡 ∈ (2nd𝐿)) → ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)))
1312ex 115 . . . 4 (𝜑 → (𝑡 ∈ (2nd𝐿) → ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿))))
141, 2, 3, 4caucvgprprlemupu 7820 . . . . . 6 ((𝜑𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)) → 𝑡 ∈ (2nd𝐿))
15143expib 1209 . . . . 5 (𝜑 → ((𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)) → 𝑡 ∈ (2nd𝐿)))
1615rexlimdvw 2628 . . . 4 (𝜑 → (∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)) → 𝑡 ∈ (2nd𝐿)))
1713, 16impbid 129 . . 3 (𝜑 → (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿))))
1817ralrimivw 2581 . 2 (𝜑 → ∀𝑡Q (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿))))
1911, 18jca 306 1 (𝜑 → (∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))) ∧ ∀𝑡Q (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2177  {cab 2192  wral 2485  wrex 2486  {crab 2489  cop 3637   class class class wbr 4047  wf 5272  cfv 5276  (class class class)co 5951  1st c1st 6231  2nd c2nd 6232  1oc1o 6502  [cec 6625  Ncnpi 7392   <N clti 7395   ~Q ceq 7399  Qcnq 7400   +Q cplq 7402  *Qcrq 7404   <Q cltq 7405  Pcnp 7411   +P cpp 7413  <P cltp 7415
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-eprel 4340  df-id 4344  df-po 4347  df-iso 4348  df-iord 4417  df-on 4419  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-1o 6509  df-2o 6510  df-oadd 6513  df-omul 6514  df-er 6627  df-ec 6629  df-qs 6633  df-ni 7424  df-pli 7425  df-mi 7426  df-lti 7427  df-plpq 7464  df-mpq 7465  df-enq 7467  df-nqqs 7468  df-plqqs 7469  df-mqqs 7470  df-1nqqs 7471  df-rq 7472  df-ltnqqs 7473  df-enq0 7544  df-nq0 7545  df-0nq0 7546  df-plq0 7547  df-mq0 7548  df-inp 7586  df-iplp 7588  df-iltp 7590
This theorem is referenced by:  caucvgprprlemcl  7824
  Copyright terms: Public domain W3C validator