Theorem caucvgprlemdisj 7937

Description: Lemma for caucvgpr 7945. The putative limit is disjoint. (Contributed by Jim Kingdon, 27-Sep-2020.)

Hypotheses

Ref	Expression
caucvgpr.f	⊢ (𝜑 → 𝐹:N⟶Q)
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
caucvgprlemdisj	⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))

Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑘   𝐹,𝑙,𝑗   𝑢,𝐹,𝑗   𝑛,𝐹   𝑗,𝐿,𝑘   𝜑,𝑗,𝑠,𝑘   𝑠,𝑙   𝑢,𝑠   𝑘,𝑛

Allowed substitution hints:   𝜑(𝑢,𝑛,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑠,𝑙)   𝐹(𝑠)   𝐿(𝑢,𝑛,𝑠,𝑙)

Proof of Theorem caucvgprlemdisj

Step	Hyp	Ref	Expression
1		oveq1 6035	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑠 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
2	1	breq1d 4103	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑠 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
3	2	rexbidv 2534	. . . . . . . . . 10 ⊢ (𝑙 = 𝑠 → (∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
4		caucvgpr.lim	. . . . . . . . . . . 12 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
5	4	fveq2i 5651	. . . . . . . . . . 11 ⊢ (1st ‘𝐿) = (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
6		nqex 7626	. . . . . . . . . . . . 13 ⊢ Q ∈ V
7	6	rabex 4239	. . . . . . . . . . . 12 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ V
8	6	rabex 4239	. . . . . . . . . . . 12 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ V
9	7, 8	op1st 6318	. . . . . . . . . . 11 ⊢ (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩) = {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}
10	5, 9	eqtri 2252	. . . . . . . . . 10 ⊢ (1st ‘𝐿) = {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}
11	3, 10	elrab2 2966	. . . . . . . . 9 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
12	11	simprbi 275	. . . . . . . 8 ⊢ (𝑠 ∈ (1st ‘𝐿) → ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
13		opeq1 3867	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑘 → ⟨𝑗, 1o⟩ = ⟨𝑘, 1o⟩)
14	13	eceq1d 6781	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑘 → [⟨𝑗, 1o⟩] ~Q = [⟨𝑘, 1o⟩] ~Q )
15	14	fveq2d 5652	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑘 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝑘, 1o⟩] ~Q ))
16	15	oveq2d 6044	. . . . . . . . . 10 ⊢ (𝑗 = 𝑘 → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )))
17		fveq2 5648	. . . . . . . . . 10 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘))
18	16, 17	breq12d 4106	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → ((𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘)))
19	18	cbvrexv 2769	. . . . . . . 8 ⊢ (∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ ∃𝑘 ∈ N (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘))
20	12, 19	sylib 122	. . . . . . 7 ⊢ (𝑠 ∈ (1st ‘𝐿) → ∃𝑘 ∈ N (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘))
21		breq2 4097	. . . . . . . . . 10 ⊢ (𝑢 = 𝑠 → (((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
22	21	rexbidv 2534	. . . . . . . . 9 ⊢ (𝑢 = 𝑠 → (∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
23	4	fveq2i 5651	. . . . . . . . . 10 ⊢ (2nd ‘𝐿) = (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
24	7, 8	op2nd 6319	. . . . . . . . . 10 ⊢ (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩) = {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
25	23, 24	eqtri 2252	. . . . . . . . 9 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
26	22, 25	elrab2 2966	. . . . . . . 8 ⊢ (𝑠 ∈ (2nd ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
27	26	simprbi 275	. . . . . . 7 ⊢ (𝑠 ∈ (2nd ‘𝐿) → ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠)
28	20, 27	anim12i 338	. . . . . 6 ⊢ ((𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) → (∃𝑘 ∈ N (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
29		reeanv 2704	. . . . . 6 ⊢ (∃𝑘 ∈ N ∃𝑗 ∈ N ((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠) ↔ (∃𝑘 ∈ N (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
30	28, 29	sylibr 134	. . . . 5 ⊢ ((𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) → ∃𝑘 ∈ N ∃𝑗 ∈ N ((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
31	30	adantl 277	. . . 4 ⊢ ((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) → ∃𝑘 ∈ N ∃𝑗 ∈ N ((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
32		caucvgpr.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹:N⟶Q)
33	32	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → 𝐹:N⟶Q)
34		caucvgpr.cau	. . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
35	34	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
36		simprl 531	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → 𝑘 ∈ N)
37		simprr 533	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → 𝑗 ∈ N)
38	11	simplbi 274	. . . . . . . . 9 ⊢ (𝑠 ∈ (1st ‘𝐿) → 𝑠 ∈ Q)
39	38	ad2antrl 490	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) → 𝑠 ∈ Q)
40	39	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → 𝑠 ∈ Q)
41	33, 35, 36, 37, 40	caucvgprlemnkj 7929	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → ¬ ((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
42	41	pm2.21d 624	. . . . 5 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → (((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠) → ⊥))
43	42	rexlimdvva 2659	. . . 4 ⊢ ((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) → (∃𝑘 ∈ N ∃𝑗 ∈ N ((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠) → ⊥))
44	31, 43	mpd 13	. . 3 ⊢ ((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) → ⊥)
45	44	inegd 1417	. 2 ⊢ (𝜑 → ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
46	45	ralrimivw 2607	1 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1398  ⊥wfal 1403   ∈ wcel 2202  ∀wral 2511  ∃wrex 2512  {crab 2515  ⟨cop 3676   class class class wbr 4093  ⟶wf 5329  ‘cfv 5333  (class class class)co 6028  1^st c1st 6310  2^nd c2nd 6311  1_oc1o 6618  [cec 6743  Ncnpi 7535   <_N clti 7538   ~_Q ceq 7542  Qcnq 7543   +_Q cplq 7545  *_Qcrq 7547   <_Q cltq 7548

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616

This theorem is referenced by:  caucvgprlemcl  7939