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

Theorem caucvgprprlemcl 7702
Description: Lemma for caucvgprpr 7710. The putative limit is a positive real. (Contributed by Jim Kingdon, 21-Nov-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
caucvgprprlemcl (𝜑𝐿P)
Distinct variable groups:   𝐴,𝑚   𝑚,𝐹   𝐴,𝑟   𝐹,𝑙,𝑢,𝑟,𝑘   𝑛,𝐹,𝑘   𝑘,𝐿   𝜑,𝑟   𝑢,𝑙,𝑝,𝑞,𝑟   𝑚,𝑟   𝑘,𝑝,𝑞,𝑟   𝑢,𝑛,𝑙,𝑘
Allowed substitution hints:   𝜑(𝑢,𝑘,𝑚,𝑛,𝑞,𝑝,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑞,𝑝,𝑙)   𝐹(𝑞,𝑝)   𝐿(𝑢,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem caucvgprprlemcl
Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 caucvgprpr.f . . . 4 (𝜑𝐹:NP)
2 caucvgprpr.cau . . . 4 (𝜑 → ∀𝑛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 . . . 4 (𝜑 → ∀𝑚N 𝐴<P (𝐹𝑚))
4 caucvgprpr.lim . . . 4 𝐿 = ⟨{𝑙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, 4caucvgprprlemm 7694 . . 3 (𝜑 → (∃𝑠Q 𝑠 ∈ (1st𝐿) ∧ ∃𝑡Q 𝑡 ∈ (2nd𝐿)))
6 ssrab2 3240 . . . . . 6 {𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)} ⊆ Q
7 nqex 7361 . . . . . . 7 Q ∈ V
87elpw2 4157 . . . . . 6 ({𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)} ∈ 𝒫 Q ↔ {𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)} ⊆ Q)
96, 8mpbir 146 . . . . 5 {𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)} ∈ 𝒫 Q
10 ssrab2 3240 . . . . . 6 {𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩} ⊆ Q
117elpw2 4157 . . . . . 6 ({𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩} ∈ 𝒫 Q ↔ {𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩} ⊆ Q)
1210, 11mpbir 146 . . . . 5 {𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩} ∈ 𝒫 Q
13 opelxpi 4658 . . . . 5 (({𝑙Q ∣ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)} ∈ 𝒫 Q ∧ {𝑢Q ∣ ∃𝑟N ((𝐹𝑟) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑢}, {𝑞𝑢 <Q 𝑞}⟩} ∈ 𝒫 Q) → ⟨{𝑙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 𝑞}⟩}⟩ ∈ (𝒫 Q × 𝒫 Q))
149, 12, 13mp2an 426 . . . 4 ⟨{𝑙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 𝑞}⟩}⟩ ∈ (𝒫 Q × 𝒫 Q)
154, 14eqeltri 2250 . . 3 𝐿 ∈ (𝒫 Q × 𝒫 Q)
165, 15jctil 312 . 2 (𝜑 → (𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠Q 𝑠 ∈ (1st𝐿) ∧ ∃𝑡Q 𝑡 ∈ (2nd𝐿))))
171, 2, 3, 4caucvgprprlemrnd 7699 . . 3 (𝜑 → (∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))) ∧ ∀𝑡Q (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)))))
181, 2, 3, 4caucvgprprlemdisj 7700 . . 3 (𝜑 → ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
191, 2, 3, 4caucvgprprlemloc 7701 . . 3 (𝜑 → ∀𝑠Q𝑡Q (𝑠 <Q 𝑡 → (𝑠 ∈ (1st𝐿) ∨ 𝑡 ∈ (2nd𝐿))))
2017, 18, 193jca 1177 . 2 (𝜑 → ((∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))) ∧ ∀𝑡Q (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)))) ∧ ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)) ∧ ∀𝑠Q𝑡Q (𝑠 <Q 𝑡 → (𝑠 ∈ (1st𝐿) ∨ 𝑡 ∈ (2nd𝐿)))))
21 elnp1st2nd 7474 . 2 (𝐿P ↔ ((𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠Q 𝑠 ∈ (1st𝐿) ∧ ∃𝑡Q 𝑡 ∈ (2nd𝐿))) ∧ ((∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑡Q (𝑠 <Q 𝑡𝑡 ∈ (1st𝐿))) ∧ ∀𝑡Q (𝑡 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑡𝑠 ∈ (2nd𝐿)))) ∧ ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)) ∧ ∀𝑠Q𝑡Q (𝑠 <Q 𝑡 → (𝑠 ∈ (1st𝐿) ∨ 𝑡 ∈ (2nd𝐿))))))
2216, 20, 21sylanbrc 417 1 (𝜑𝐿P)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 708  w3a 978   = wceq 1353  wcel 2148  {cab 2163  wral 2455  wrex 2456  {crab 2459  wss 3129  𝒫 cpw 3575  cop 3595   class class class wbr 4003   × cxp 4624  wf 5212  cfv 5216  (class class class)co 5874  1st c1st 6138  2nd c2nd 6139  1oc1o 6409  [cec 6532  Ncnpi 7270   <N clti 7273   ~Q ceq 7277  Qcnq 7278   +Q cplq 7280  *Qcrq 7282   <Q cltq 7283  Pcnp 7289   +P cpp 7291  <P cltp 7293
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 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536  ax-iinf 4587
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 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-eprel 4289  df-id 4293  df-po 4296  df-iso 4297  df-iord 4366  df-on 4368  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-recs 6305  df-irdg 6370  df-1o 6416  df-2o 6417  df-oadd 6420  df-omul 6421  df-er 6534  df-ec 6536  df-qs 6540  df-ni 7302  df-pli 7303  df-mi 7304  df-lti 7305  df-plpq 7342  df-mpq 7343  df-enq 7345  df-nqqs 7346  df-plqqs 7347  df-mqqs 7348  df-1nqqs 7349  df-rq 7350  df-ltnqqs 7351  df-enq0 7422  df-nq0 7423  df-0nq0 7424  df-plq0 7425  df-mq0 7426  df-inp 7464  df-iplp 7466  df-iltp 7468
This theorem is referenced by:  caucvgprprlemclphr  7703  caucvgprprlemaddq  7706  caucvgprprlem2  7708  caucvgprpr  7710
  Copyright terms: Public domain W3C validator