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

Theorem caucvgprprlemdisj 7719
Description: Lemma for caucvgprpr 7729. The putative limit is disjoint. (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
caucvgprprlemdisj (𝜑 → ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
Distinct variable groups:   𝐴,𝑚   𝑚,𝐹   𝑘,𝐹,𝑛,𝑙   𝐹,𝑟,𝑙   𝑢,𝐹,𝑟   𝑘,𝐿   𝑘,𝑝,𝑟,𝑠   𝜑,𝑟,𝑠   𝑘,𝑞,𝑟,𝑠   𝑝,𝑙,𝑠,𝑞   𝑢,𝑝,𝑠,𝑞   𝑢,𝑛   𝑛,𝑙,𝑘   𝑢,𝑘
Allowed substitution hints:   𝜑(𝑢,𝑘,𝑚,𝑛,𝑞,𝑝,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑠,𝑟,𝑞,𝑝,𝑙)   𝐹(𝑠,𝑞,𝑝)   𝐿(𝑢,𝑚,𝑛,𝑠,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem caucvgprprlemdisj
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 caucvgprpr.lim . . . . . . . . 9 𝐿 = ⟨{𝑙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 𝑞}⟩}⟩
21caucvgprprlemell 7702 . . . . . . . 8 (𝑠 ∈ (1st𝐿) ↔ (𝑠Q ∧ ∃𝑎N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎)))
32simprbi 275 . . . . . . 7 (𝑠 ∈ (1st𝐿) → ∃𝑎N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎))
41caucvgprprlemelu 7703 . . . . . . . 8 (𝑠 ∈ (2nd𝐿) ↔ (𝑠Q ∧ ∃𝑏N ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
54simprbi 275 . . . . . . 7 (𝑠 ∈ (2nd𝐿) → ∃𝑏N ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩)
63, 5anim12i 338 . . . . . 6 ((𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)) → (∃𝑎N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ∃𝑏N ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
7 reeanv 2660 . . . . . 6 (∃𝑎N𝑏N (⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩) ↔ (∃𝑎N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ∃𝑏N ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
86, 7sylibr 134 . . . . 5 ((𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)) → ∃𝑎N𝑏N (⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
98adantl 277 . . . 4 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → ∃𝑎N𝑏N (⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
10 caucvgprpr.f . . . . . . . 8 (𝜑𝐹:NP)
1110ad2antrr 488 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝐹:NP)
12 caucvgprpr.cau . . . . . . . 8 (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛)<P ((𝐹𝑘) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹𝑘)<P ((𝐹𝑛) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
1312ad2antrr 488 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛)<P ((𝐹𝑘) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹𝑘)<P ((𝐹𝑛) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
14 simprl 529 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝑎N)
15 simprr 531 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝑏N)
161caucvgprprlemell 7702 . . . . . . . . . 10 (𝑠 ∈ (1st𝐿) ↔ (𝑠Q ∧ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)))
1716simplbi 274 . . . . . . . . 9 (𝑠 ∈ (1st𝐿) → 𝑠Q)
1817ad2antrl 490 . . . . . . . 8 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → 𝑠Q)
1918adantr 276 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝑠Q)
2011, 13, 14, 15, 19caucvgprprlemnkj 7709 . . . . . 6 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → ¬ (⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
2120pm2.21d 620 . . . . 5 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → ((⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩) → ⊥))
2221rexlimdvva 2615 . . . 4 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → (∃𝑎N𝑏N (⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎) ∧ ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩) → ⊥))
239, 22mpd 13 . . 3 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → ⊥)
2423inegd 1383 . 2 (𝜑 → ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
2524ralrimivw 2564 1 (𝜑 → ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1364  wfal 1369  wcel 2160  {cab 2175  wral 2468  wrex 2469  {crab 2472  cop 3610   class class class wbr 4018  wf 5227  cfv 5231  (class class class)co 5891  1st c1st 6157  2nd c2nd 6158  1oc1o 6428  [cec 6551  Ncnpi 7289   <N clti 7292   ~Q ceq 7296  Qcnq 7297   +Q cplq 7299  *Qcrq 7301   <Q cltq 7302  Pcnp 7308   +P cpp 7310  <P cltp 7312
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-iinf 4602
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-eprel 4304  df-id 4308  df-po 4311  df-iso 4312  df-iord 4381  df-on 4383  df-suc 4386  df-iom 4605  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5233  df-fn 5234  df-f 5235  df-f1 5236  df-fo 5237  df-f1o 5238  df-fv 5239  df-ov 5894  df-oprab 5895  df-mpo 5896  df-1st 6159  df-2nd 6160  df-recs 6324  df-irdg 6389  df-1o 6435  df-2o 6436  df-oadd 6439  df-omul 6440  df-er 6553  df-ec 6555  df-qs 6559  df-ni 7321  df-pli 7322  df-mi 7323  df-lti 7324  df-plpq 7361  df-mpq 7362  df-enq 7364  df-nqqs 7365  df-plqqs 7366  df-mqqs 7367  df-1nqqs 7368  df-rq 7369  df-ltnqqs 7370  df-enq0 7441  df-nq0 7442  df-0nq0 7443  df-plq0 7444  df-mq0 7445  df-inp 7483  df-iplp 7485  df-iltp 7487
This theorem is referenced by:  caucvgprprlemcl  7721
  Copyright terms: Public domain W3C validator