Theorem caucvgprprlemdisj 7828

Description: Lemma for caucvgprpr 7838. The putative limit is disjoint. (Contributed by Jim Kingdon, 21-Dec-2020.)

Hypotheses

Ref	Expression
caucvgprpr.f	⊢ (𝜑 → 𝐹:N⟶P)
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.

Step	Hyp	Ref	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 𝑞}⟩}⟩
2	1	caucvgprprlemell 7811	. . . . . . . 8 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑎 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑎)))
3	2	simprbi 275	. . . . . . 7 ⊢ (𝑠 ∈ (1st ‘𝐿) → ∃𝑎 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑎))
4	1	caucvgprprlemelu 7812	. . . . . . . 8 ⊢ (𝑠 ∈ (2nd ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑏 ∈ N ((𝐹‘𝑏) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑠}, {𝑞 ∣ 𝑠 <Q 𝑞}⟩))
5	4	simprbi 275	. . . . . . 7 ⊢ (𝑠 ∈ (2nd ‘𝐿) → ∃𝑏 ∈ N ((𝐹‘𝑏) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑏, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑏, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑠}, {𝑞 ∣ 𝑠 <Q 𝑞}⟩)
6	3, 5	anim12i 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 2677	. . . . . 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 𝑞}⟩))
8	6, 7	sylibr 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 𝑞}⟩))
9	8	adantl 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 ⊢ (𝜑 → 𝐹:N⟶P)
11	10	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑎 ∈ N ∧ 𝑏 ∈ N)) → 𝐹:N⟶P)
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 𝑢}⟩))))
13	12	ad2antrr 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)
16	1	caucvgprprlemell 7811	. . . . . . . . . 10 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑠 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑠 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)))
17	16	simplbi 274	. . . . . . . . 9 ⊢ (𝑠 ∈ (1st ‘𝐿) → 𝑠 ∈ Q)
18	17	ad2antrl 490	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) → 𝑠 ∈ Q)
19	18	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑎 ∈ N ∧ 𝑏 ∈ N)) → 𝑠 ∈ Q)
20	11, 13, 14, 15, 19	caucvgprprlemnkj 7818	. . . . . 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 𝑞}⟩))
21	20	pm2.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 𝑞}⟩) → ⊥))
22	21	rexlimdvva 2632	. . . 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 𝑞}⟩) → ⊥))
23	9, 22	mpd 13	. . 3 ⊢ ((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) → ⊥)
24	23	inegd 1392	. 2 ⊢ (𝜑 → ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
25	24	ralrimivw 2581	1 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1373  ⊥wfal 1378   ∈ wcel 2177  {cab 2192  ∀wral 2485  ∃wrex 2486  {crab 2489  ⟨cop 3638   class class class wbr 4048  ⟶wf 5273  ‘cfv 5277  (class class class)co 5954  1^st c1st 6234  2^nd c2nd 6235  1_oc1o 6505  [cec 6628  Ncnpi 7398   <_N clti 7401   ~_Q ceq 7405  Qcnq 7406   +_Q cplq 7408  *_Qcrq 7410   <_Q cltq 7411  Pcnp 7417   +_P cpp 7419  <_P cltp 7421

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4164  ax-sep 4167  ax-nul 4175  ax-pow 4223  ax-pr 4258  ax-un 4485  ax-setind 4590  ax-iinf 4641

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3001  df-csb 3096  df-dif 3170  df-un 3172  df-in 3174  df-ss 3181  df-nul 3463  df-pw 3620  df-sn 3641  df-pr 3642  df-op 3644  df-uni 3854  df-int 3889  df-iun 3932  df-br 4049  df-opab 4111  df-mpt 4112  df-tr 4148  df-eprel 4341  df-id 4345  df-po 4348  df-iso 4349  df-iord 4418  df-on 4420  df-suc 4423  df-iom 4644  df-xp 4686  df-rel 4687  df-cnv 4688  df-co 4689  df-dm 4690  df-rn 4691  df-res 4692  df-ima 4693  df-iota 5238  df-fun 5279  df-fn 5280  df-f 5281  df-f1 5282  df-fo 5283  df-f1o 5284  df-fv 5285  df-ov 5957  df-oprab 5958  df-mpo 5959  df-1st 6236  df-2nd 6237  df-recs 6401  df-irdg 6466  df-1o 6512  df-2o 6513  df-oadd 6516  df-omul 6517  df-er 6630  df-ec 6632  df-qs 6636  df-ni 7430  df-pli 7431  df-mi 7432  df-lti 7433  df-plpq 7470  df-mpq 7471  df-enq 7473  df-nqqs 7474  df-plqqs 7475  df-mqqs 7476  df-1nqqs 7477  df-rq 7478  df-ltnqqs 7479  df-enq0 7550  df-nq0 7551  df-0nq0 7552  df-plq0 7553  df-mq0 7554  df-inp 7592  df-iplp 7594  df-iltp 7596

This theorem is referenced by:  caucvgprprlemcl  7830