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

Theorem caucvgprlemdisj 6772
 Description: Lemma for caucvgpr 6780. The putative limit is disjoint. (Contributed by Jim Kingdon, 27-Sep-2020.)
Hypotheses
Ref Expression
caucvgpr.f (𝜑𝐹:NQ)
caucvgpr.cau (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛) <Q ((𝐹𝑘) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
caucvgpr.bnd (𝜑 → ∀𝑗N 𝐴 <Q (𝐹𝑗))
caucvgpr.lim 𝐿 = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩
Assertion
Ref Expression
caucvgprlemdisj (𝜑 → ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑘   𝐹,𝑙,𝑗   𝑢,𝐹,𝑗   𝑛,𝐹   𝑗,𝐿,𝑘   𝜑,𝑗,𝑠,𝑘   𝑠,𝑙   𝑢,𝑠   𝑘,𝑛
Allowed substitution hints:   𝜑(𝑢,𝑛,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑠,𝑙)   𝐹(𝑠)   𝐿(𝑢,𝑛,𝑠,𝑙)

Proof of Theorem caucvgprlemdisj
StepHypRef Expression
1 oveq1 5519 . . . . . . . . . . . 12 (𝑙 = 𝑠 → (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )))
21breq1d 3774 . . . . . . . . . . 11 (𝑙 = 𝑠 → ((𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)))
32rexbidv 2327 . . . . . . . . . 10 (𝑙 = 𝑠 → (∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗) ↔ ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)))
4 caucvgpr.lim . . . . . . . . . . . 12 𝐿 = ⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩
54fveq2i 5181 . . . . . . . . . . 11 (1st𝐿) = (1st ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩)
6 nqex 6461 . . . . . . . . . . . . 13 Q ∈ V
76rabex 3901 . . . . . . . . . . . 12 {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)} ∈ V
86rabex 3901 . . . . . . . . . . . 12 {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢} ∈ V
97, 8op1st 5773 . . . . . . . . . . 11 (1st ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩) = {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}
105, 9eqtri 2060 . . . . . . . . . 10 (1st𝐿) = {𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}
113, 10elrab2 2700 . . . . . . . . 9 (𝑠 ∈ (1st𝐿) ↔ (𝑠Q ∧ ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)))
1211simprbi 260 . . . . . . . 8 (𝑠 ∈ (1st𝐿) → ∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗))
13 opeq1 3549 . . . . . . . . . . . . 13 (𝑗 = 𝑘 → ⟨𝑗, 1𝑜⟩ = ⟨𝑘, 1𝑜⟩)
1413eceq1d 6142 . . . . . . . . . . . 12 (𝑗 = 𝑘 → [⟨𝑗, 1𝑜⟩] ~Q = [⟨𝑘, 1𝑜⟩] ~Q )
1514fveq2d 5182 . . . . . . . . . . 11 (𝑗 = 𝑘 → (*Q‘[⟨𝑗, 1𝑜⟩] ~Q ) = (*Q‘[⟨𝑘, 1𝑜⟩] ~Q ))
1615oveq2d 5528 . . . . . . . . . 10 (𝑗 = 𝑘 → (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) = (𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )))
17 fveq2 5178 . . . . . . . . . 10 (𝑗 = 𝑘 → (𝐹𝑗) = (𝐹𝑘))
1816, 17breq12d 3777 . . . . . . . . 9 (𝑗 = 𝑘 → ((𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗) ↔ (𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘)))
1918cbvrexv 2534 . . . . . . . 8 (∃𝑗N (𝑠 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗) ↔ ∃𝑘N (𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘))
2012, 19sylib 127 . . . . . . 7 (𝑠 ∈ (1st𝐿) → ∃𝑘N (𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘))
21 breq2 3768 . . . . . . . . . 10 (𝑢 = 𝑠 → (((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
2221rexbidv 2327 . . . . . . . . 9 (𝑢 = 𝑠 → (∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢 ↔ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
234fveq2i 5181 . . . . . . . . . 10 (2nd𝐿) = (2nd ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩)
247, 8op2nd 5774 . . . . . . . . . 10 (2nd ‘⟨{𝑙Q ∣ ∃𝑗N (𝑙 +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q (𝐹𝑗)}, {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}⟩) = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}
2523, 24eqtri 2060 . . . . . . . . 9 (2nd𝐿) = {𝑢Q ∣ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑢}
2622, 25elrab2 2700 . . . . . . . 8 (𝑠 ∈ (2nd𝐿) ↔ (𝑠Q ∧ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
2726simprbi 260 . . . . . . 7 (𝑠 ∈ (2nd𝐿) → ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠)
2820, 27anim12i 321 . . . . . 6 ((𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)) → (∃𝑘N (𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
29 reeanv 2479 . . . . . 6 (∃𝑘N𝑗N ((𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠) ↔ (∃𝑘N (𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ∃𝑗N ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
3028, 29sylibr 137 . . . . 5 ((𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)) → ∃𝑘N𝑗N ((𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
3130adantl 262 . . . 4 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → ∃𝑘N𝑗N ((𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
32 caucvgpr.f . . . . . . . 8 (𝜑𝐹:NQ)
3332ad2antrr 457 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → 𝐹:NQ)
34 caucvgpr.cau . . . . . . . 8 (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛) <Q ((𝐹𝑘) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
3534ad2antrr 457 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛) <Q ((𝐹𝑘) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )) ∧ (𝐹𝑘) <Q ((𝐹𝑛) +Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )))))
36 simprl 483 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → 𝑘N)
37 simprr 484 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → 𝑗N)
3811simplbi 259 . . . . . . . . 9 (𝑠 ∈ (1st𝐿) → 𝑠Q)
3938ad2antrl 459 . . . . . . . 8 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → 𝑠Q)
4039adantr 261 . . . . . . 7 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → 𝑠Q)
4133, 35, 36, 37, 40caucvgprlemnkj 6764 . . . . . 6 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → ¬ ((𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠))
4241pm2.21d 549 . . . . 5 (((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) ∧ (𝑘N𝑗N)) → (((𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠) → ⊥))
4342rexlimdvva 2440 . . . 4 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → (∃𝑘N𝑗N ((𝑠 +Q (*Q‘[⟨𝑘, 1𝑜⟩] ~Q )) <Q (𝐹𝑘) ∧ ((𝐹𝑗) +Q (*Q‘[⟨𝑗, 1𝑜⟩] ~Q )) <Q 𝑠) → ⊥))
4431, 43mpd 13 . . 3 ((𝜑 ∧ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿))) → ⊥)
4544inegd 1263 . 2 (𝜑 → ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
4645ralrimivw 2393 1 (𝜑 → ∀𝑠Q ¬ (𝑠 ∈ (1st𝐿) ∧ 𝑠 ∈ (2nd𝐿)))
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 97   = wceq 1243  ⊥wfal 1248   ∈ wcel 1393  ∀wral 2306  ∃wrex 2307  {crab 2310  ⟨cop 3378   class class class wbr 3764  ⟶wf 4898  ‘cfv 4902  (class class class)co 5512  1st c1st 5765  2nd c2nd 5766  1𝑜c1o 5994  [cec 6104  Ncnpi 6370
 Copyright terms: Public domain W3C validator