Theorem caucvgprlemdisj 7869

Description: Lemma for caucvgpr 7877. 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 6014	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑠 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )))
2	1	breq1d 4093	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑠 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
3	2	rexbidv 2531	. . . . . . . . . 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 5632	. . . . . . . . . . 11 ⊢ (1st ‘𝐿) = (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
6		nqex 7558	. . . . . . . . . . . . 13 ⊢ Q ∈ V
7	6	rabex 4228	. . . . . . . . . . . 12 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ V
8	6	rabex 4228	. . . . . . . . . . . 12 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ V
9	7, 8	op1st 6298	. . . . . . . . . . 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 2250	. . . . . . . . . 10 ⊢ (1st ‘𝐿) = {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}
11	3, 10	elrab2 2962	. . . . . . . . 9 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)))
12	11	simprbi 275	. . . . . . . 8 ⊢ (𝑠 ∈ (1st ‘𝐿) → ∃𝑗 ∈ N (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗))
13		opeq1 3857	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑘 → ⟨𝑗, 1o⟩ = ⟨𝑘, 1o⟩)
14	13	eceq1d 6724	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑘 → [⟨𝑗, 1o⟩] ~Q = [⟨𝑘, 1o⟩] ~Q )
15	14	fveq2d 5633	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑘 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝑘, 1o⟩] ~Q ))
16	15	oveq2d 6023	. . . . . . . . . 10 ⊢ (𝑗 = 𝑘 → (𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )))
17		fveq2 5629	. . . . . . . . . 10 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘))
18	16, 17	breq12d 4096	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → ((𝑠 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘)))
19	18	cbvrexv 2766	. . . . . . . 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 4087	. . . . . . . . . 10 ⊢ (𝑢 = 𝑠 → (((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
22	21	rexbidv 2531	. . . . . . . . 9 ⊢ (𝑢 = 𝑠 → (∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
23	4	fveq2i 5632	. . . . . . . . . 10 ⊢ (2nd ‘𝐿) = (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩)
24	7, 8	op2nd 6299	. . . . . . . . . 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 2250	. . . . . . . . 9 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}
26	22, 25	elrab2 2962	. . . . . . . 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 2701	. . . . . 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 529	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → 𝑘 ∈ N)
37		simprr 531	. . . . . . 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 7861	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → ¬ ((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠))
42	41	pm2.21d 622	. . . . 5 ⊢ (((𝜑 ∧ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) ∧ (𝑘 ∈ N ∧ 𝑗 ∈ N)) → (((𝑠 +Q (*Q‘[⟨𝑘, 1o⟩] ~Q )) <Q (𝐹‘𝑘) ∧ ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑠) → ⊥))
43	42	rexlimdvva 2656	. . . 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 1414	. 2 ⊢ (𝜑 → ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
46	45	ralrimivw 2604	1 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1395  ⊥wfal 1400   ∈ wcel 2200  ∀wral 2508  ∃wrex 2509  {crab 2512  ⟨cop 3669   class class class wbr 4083  ⟶wf 5314  ‘cfv 5318  (class class class)co 6007  1^st c1st 6290  2^nd c2nd 6291  1_oc1o 6561  [cec 6686  Ncnpi 7467   <_N clti 7470   ~_Q ceq 7474  Qcnq 7475   +_Q cplq 7477  *_Qcrq 7479   <_Q cltq 7480

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-eprel 4380  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-irdg 6522  df-1o 6568  df-oadd 6572  df-omul 6573  df-er 6688  df-ec 6690  df-qs 6694  df-ni 7499  df-pli 7500  df-mi 7501  df-lti 7502  df-plpq 7539  df-mpq 7540  df-enq 7542  df-nqqs 7543  df-plqqs 7544  df-mqqs 7545  df-1nqqs 7546  df-rq 7547  df-ltnqqs 7548

This theorem is referenced by:  caucvgprlemcl  7871