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

Theorem caucvgprprlemdisj 7322
Description: Lemma for caucvgprpr 7332. 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 7305 . . . . . . . 8 (𝑠 ∈ (1st𝐿) ↔ (𝑠Q ∧ ∃𝑎N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎)))
32simprbi 270 . . . . . . 7 (𝑠 ∈ (1st𝐿) → ∃𝑎N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑎))
41caucvgprprlemelu 7306 . . . . . . . 8 (𝑠 ∈ (2nd𝐿) ↔ (𝑠Q ∧ ∃𝑏N ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩))
54simprbi 270 . . . . . . 7 (𝑠 ∈ (2nd𝐿) → ∃𝑏N ((𝐹𝑏) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑠}, {𝑞𝑠 <Q 𝑞}⟩)
63, 5anim12i 332 . . . . . 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 2537 . . . . . 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 133 . . . . 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 272 . . . 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 473 . . . . . . 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 473 . . . . . . 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 499 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝑎N)
15 simprr 500 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝑏N)
161caucvgprprlemell 7305 . . . . . . . . . 10 (𝑠 ∈ (1st𝐿) ↔ (𝑠Q ∧ ∃𝑟N ⟨{𝑝𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝑟)))
1716simplbi 269 . . . . . . . . 9 (𝑠 ∈ (1st𝐿) → 𝑠Q)
1817ad2antrl 475 . . . . . . . 8 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → 𝑠Q)
1918adantr 271 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑎N𝑏N)) → 𝑠Q)
2011, 13, 14, 15, 19caucvgprprlemnkj 7312 . . . . . 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 585 . . . . 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 2497 . . . 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 1309 . 2 (𝜑 → ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
2524ralrimivw 2448 1 (𝜑 → ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103   = wceq 1290  wfal 1295  wcel 1439  {cab 2075  wral 2360  wrex 2361  {crab 2364  cop 3453   class class class wbr 3851  wf 5024  cfv 5028  (class class class)co 5666  1st c1st 5923  2nd c2nd 5924  1oc1o 6188  [cec 6304  Ncnpi 6892   <N clti 6895   ~Q ceq 6899  Qcnq 6900   +Q cplq 6902  *Qcrq 6904   <Q cltq 6905  Pcnp 6911   +P cpp 6913  <P cltp 6915
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-nul 3971  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-iinf 4416
This theorem depends on definitions:  df-bi 116  df-dc 782  df-3or 926  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-nul 3288  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-int 3695  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-tr 3943  df-eprel 4125  df-id 4129  df-po 4132  df-iso 4133  df-iord 4202  df-on 4204  df-suc 4207  df-iom 4419  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-rn 4463  df-res 4464  df-ima 4465  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-1st 5925  df-2nd 5926  df-recs 6084  df-irdg 6149  df-1o 6195  df-2o 6196  df-oadd 6199  df-omul 6200  df-er 6306  df-ec 6308  df-qs 6312  df-ni 6924  df-pli 6925  df-mi 6926  df-lti 6927  df-plpq 6964  df-mpq 6965  df-enq 6967  df-nqqs 6968  df-plqqs 6969  df-mqqs 6970  df-1nqqs 6971  df-rq 6972  df-ltnqqs 6973  df-enq0 7044  df-nq0 7045  df-0nq0 7046  df-plq0 7047  df-mq0 7048  df-inp 7086  df-iplp 7088  df-iltp 7090
This theorem is referenced by:  caucvgprprlemcl  7324
  Copyright terms: Public domain W3C validator