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

Theorem caucvgprlemopu 8038
Description: Lemma for caucvgpr 8049. The upper cut of the putative limit is open. (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
caucvgprlemopu ((𝜑𝑟 ∈ (2nd𝐿)) → ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)))
Distinct variable groups:   𝐴,𝑗   𝐹,𝑙,𝑟,𝑠   𝑢,𝐹   𝑗,𝐿,𝑟,𝑠   𝑗,𝑙,𝑠   𝜑,𝑗,𝑟,𝑠   𝑢,𝑗,𝑟,𝑠
Allowed substitution hints:   𝜑(𝑢, 𝑘, 𝑛, 𝑙)   𝐴(𝑢, 𝑘, 𝑛, 𝑠, 𝑟, 𝑙)   𝐹(𝑗, 𝑘, 𝑛)   𝐿(𝑢, 𝑘, 𝑛, 𝑙)

Proof of Theorem caucvgprlemopu
StepHypRef Expression
1 breq2 4134 . . . . . 6 (𝑢 = 𝑟 → (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟))
21rexbidv 2551 . . . . 5 (𝑢 = 𝑟 → (∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟))
3 caucvgpr.lim . . . . . . 7 𝐿 = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
43fveq2i 5698 . . . . . 6 (2nd𝐿) = (2nd ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
5 nqex 7730 . . . . . . . 8 Q ∈ V
65rabex 4280 . . . . . . 7 {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)} ∈ V
75rabex 4280 . . . . . . 7 {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ V
86, 7op2nd 6381 . . . . . 6 (2nd ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩) = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
94, 8eqtri 2259 . . . . 5 (2nd𝐿) = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
102, 9elrab2 2985 . . . 4 (𝑟 ∈ (2nd𝐿) ↔ (𝑟Q ∧ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟))
1110simprbi 275 . . 3 (𝑟 ∈ (2nd𝐿) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)
1211adantl 277 . 2 ((𝜑𝑟 ∈ (2nd𝐿)) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)
13 simprr 537 . . . 4 (((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) → ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)
14 ltbtwnnqq 7782 . . . 4 (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟 ↔ ∃𝑠Q (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟))
1513, 14sylib 122 . . 3 (((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) → ∃𝑠Q (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟))
16 simprr 537 . . . . . 6 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → 𝑠 <Q 𝑟)
17 simplr 533 . . . . . . 7 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → 𝑠Q)
18 simplrl 541 . . . . . . . . 9 ((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) → 𝑗N)
1918adantr 276 . . . . . . . 8 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → 𝑗N)
20 simprl 535 . . . . . . . 8 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠)
21 rspe 2599 . . . . . . . 8 ((𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠)
2219, 20, 21syl2anc 415 . . . . . . 7 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠)
23 breq2 4134 . . . . . . . . 9 (𝑢 = 𝑠 → (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
2423rexbidv 2551 . . . . . . . 8 (𝑢 = 𝑠 → (∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
2524, 9elrab2 2985 . . . . . . 7 (𝑠 ∈ (2nd𝐿) ↔ (𝑠Q ∧ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
2617, 22, 25sylanbrc 421 . . . . . 6 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → 𝑠 ∈ (2nd𝐿))
2716, 26jca 306 . . . . 5 (((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) ∧ (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟)) → (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)))
2827ex 115 . . . 4 ((((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) ∧ 𝑠Q) → ((((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟) → (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿))))
2928reximdva 2652 . . 3 (((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) → (∃𝑠Q (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠𝑠 <Q 𝑟) → ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿))))
3015, 29mpd 13 . 2 (((𝜑𝑟 ∈ (2nd𝐿)) ∧ (𝑗N ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑟)) → ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)))
3112, 30rexlimddv 2673 1 ((𝜑𝑟 ∈ (2nd𝐿)) → ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  wral 2528  wrex 2529  {crab 2532  cop 3712   class class class wbr 4130  wf 5373  cfv 5377  (class class class)co 6085  2nd c2nd 6373  1oc1o 6680  [cec 6805  Ncnpi 7639   <N clti 7642   ~Q ceq 7646  Qcnq 7647   +Q cplq 7649  *Qcrq 7651   <Q cltq 7652
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-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
This theorem is used by:  caucvgprlemrnd  8040
  Copyright terms: Public domain W3C validator