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

Theorem cauappcvgprlemrnd 7805
Description: Lemma for cauappcvgpr 7817. The putative limit is rounded. (Contributed by Jim Kingdon, 18-Jul-2020.)
Hypotheses
Ref Expression
cauappcvgpr.f (𝜑𝐹:QQ)
cauappcvgpr.app (𝜑 → ∀𝑝Q𝑞Q ((𝐹𝑝) <Q ((𝐹𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹𝑞) <Q ((𝐹𝑝) +Q (𝑝 +Q 𝑞))))
cauappcvgpr.bnd (𝜑 → ∀𝑝Q 𝐴 <Q (𝐹𝑝))
cauappcvgpr.lim 𝐿 = ⟨{𝑙Q ∣ ∃𝑞Q (𝑙 +Q 𝑞) <Q (𝐹𝑞)}, {𝑢Q ∣ ∃𝑞Q ((𝐹𝑞) +Q 𝑞) <Q 𝑢}⟩
Assertion
Ref Expression
cauappcvgprlemrnd (𝜑 → (∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑟Q (𝑠 <Q 𝑟𝑟 ∈ (1st𝐿))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)))))
Distinct variable groups:   𝐴,𝑝   𝐿,𝑝,𝑞   𝜑,𝑝,𝑞   𝐿,𝑟,𝑠   𝐴,𝑠,𝑝   𝐹,𝑙,𝑢,𝑝,𝑞,𝑟,𝑠   𝜑,𝑟,𝑠
Allowed substitution hints:   𝜑(𝑢,𝑙)   𝐴(𝑢,𝑟,𝑞,𝑙)   𝐿(𝑢,𝑙)

Proof of Theorem cauappcvgprlemrnd
StepHypRef Expression
1 cauappcvgpr.f . . . . . 6 (𝜑𝐹:QQ)
2 cauappcvgpr.app . . . . . 6 (𝜑 → ∀𝑝Q𝑞Q ((𝐹𝑝) <Q ((𝐹𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹𝑞) <Q ((𝐹𝑝) +Q (𝑝 +Q 𝑞))))
3 cauappcvgpr.bnd . . . . . 6 (𝜑 → ∀𝑝Q 𝐴 <Q (𝐹𝑝))
4 cauappcvgpr.lim . . . . . 6 𝐿 = ⟨{𝑙Q ∣ ∃𝑞Q (𝑙 +Q 𝑞) <Q (𝐹𝑞)}, {𝑢Q ∣ ∃𝑞Q ((𝐹𝑞) +Q 𝑞) <Q 𝑢}⟩
51, 2, 3, 4cauappcvgprlemopl 7801 . . . . 5 ((𝜑𝑠 ∈ (1st𝐿)) → ∃𝑟Q (𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)))
65ex 115 . . . 4 (𝜑 → (𝑠 ∈ (1st𝐿) → ∃𝑟Q (𝑠 <Q 𝑟𝑟 ∈ (1st𝐿))))
71, 2, 3, 4cauappcvgprlemlol 7802 . . . . . 6 ((𝜑𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿))
873expib 1211 . . . . 5 (𝜑 → ((𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿)))
98rexlimdvw 2632 . . . 4 (𝜑 → (∃𝑟Q (𝑠 <Q 𝑟𝑟 ∈ (1st𝐿)) → 𝑠 ∈ (1st𝐿)))
106, 9impbid 129 . . 3 (𝜑 → (𝑠 ∈ (1st𝐿) ↔ ∃𝑟Q (𝑠 <Q 𝑟𝑟 ∈ (1st𝐿))))
1110ralrimivw 2584 . 2 (𝜑 → ∀𝑠Q (𝑠 ∈ (1st𝐿) ↔ ∃𝑟Q (𝑠 <Q 𝑟𝑟 ∈ (1st𝐿))))
121, 2, 3, 4cauappcvgprlemopu 7803 . . . . 5 ((𝜑𝑟 ∈ (2nd𝐿)) → ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)))
1312ex 115 . . . 4 (𝜑 → (𝑟 ∈ (2nd𝐿) → ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿))))
141, 2, 3, 4cauappcvgprlemupu 7804 . . . . . 6 ((𝜑𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)) → 𝑟 ∈ (2nd𝐿))
15143expib 1211 . . . . 5 (𝜑 → ((𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)) → 𝑟 ∈ (2nd𝐿)))
1615rexlimdvw 2632 . . . 4 (𝜑 → (∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿)) → 𝑟 ∈ (2nd𝐿)))
1713, 16impbid 129 . . 3 (𝜑 → (𝑟 ∈ (2nd𝐿) ↔ ∃𝑠Q (𝑠 <Q 𝑟𝑠 ∈ (2nd𝐿))))
1817ralrimivw 2584 . 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 1375  wcel 2180  wral 2488  wrex 2489  {crab 2492  cop 3649   class class class wbr 4062  wf 5290  cfv 5294  (class class class)co 5974  1st c1st 6254  2nd c2nd 6255  Qcnq 7435   +Q cplq 7437   <Q cltq 7440
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 617  ax-in2 618  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-nul 4189  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-iinf 4657
This theorem depends on definitions:  df-bi 117  df-dc 839  df-3or 984  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-ral 2493  df-rex 2494  df-reu 2495  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-tr 4162  df-eprel 4357  df-id 4361  df-po 4364  df-iso 4365  df-iord 4434  df-on 4436  df-suc 4439  df-iom 4660  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-ov 5977  df-oprab 5978  df-mpo 5979  df-1st 6256  df-2nd 6257  df-recs 6421  df-irdg 6486  df-1o 6532  df-oadd 6536  df-omul 6537  df-er 6650  df-ec 6652  df-qs 6656  df-ni 7459  df-pli 7460  df-mi 7461  df-lti 7462  df-plpq 7499  df-mpq 7500  df-enq 7502  df-nqqs 7503  df-plqqs 7504  df-mqqs 7505  df-1nqqs 7506  df-rq 7507  df-ltnqqs 7508
This theorem is referenced by:  cauappcvgprlemcl  7808
  Copyright terms: Public domain W3C validator