Theorem caucvgprprlemnkj 8012

Description: Lemma for caucvgprpr 8032. Part of disjointness. (Contributed by Jim Kingdon, 20-Jan-2021.)

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 𝑢}⟩))))
caucvgprprlemnkj.k	⊢ (𝜑 → 𝐾 ∈ N)
caucvgprprlemnkj.j	⊢ (𝜑 → 𝐽 ∈ N)
caucvgprprlemnkj.s	⊢ (𝜑 → 𝑆 ∈ Q)

Assertion

Ref	Expression
caucvgprprlemnkj	⊢ (𝜑 → ¬ (⟨{𝑝 ∣ 𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝐾) ∧ ((𝐹‘𝐽) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝐽, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑆}, {𝑞 ∣ 𝑆 <Q 𝑞}⟩))

Distinct variable groups:   𝑘,𝐹,𝑛   𝐽,𝑝,𝑞   𝑢,𝐽   𝐽,𝑙   𝐾,𝑝,𝑞   𝐾,𝑙   𝑢,𝐾   𝑆,𝑝,𝑞   𝑢,𝑛   𝑛,𝑙,𝑘   𝑢,𝑘   𝑢,𝑞   𝑝,𝑙

Allowed substitution hints:   𝜑(𝑢,𝑘,𝑛,𝑞,𝑝,𝑙)   𝑆(𝑢,𝑘,𝑛,𝑙)   𝐹(𝑢,𝑞,𝑝,𝑙)   𝐽(𝑘,𝑛)   𝐾(𝑘,𝑛)

Proof of Theorem caucvgprprlemnkj

Step	Hyp	Ref	Expression
1		caucvgprpr.f	. . 3 ⊢ (𝜑 → 𝐹:N⟶P)
2		caucvgprpr.cau	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
3		caucvgprprlemnkj.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ N)
4		caucvgprprlemnkj.j	. . 3 ⊢ (𝜑 → 𝐽 ∈ N)
5		caucvgprprlemnkj.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ Q)
6	1, 2, 3, 4, 5	caucvgprprlemnkltj 8009	. 2 ⊢ ((𝜑 ∧ 𝐾 <N 𝐽) → ¬ (⟨{𝑝 ∣ 𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝐾) ∧ ((𝐹‘𝐽) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝐽, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑆}, {𝑞 ∣ 𝑆 <Q 𝑞}⟩))
7	1, 2, 3, 4, 5	caucvgprprlemnkeqj 8010	. 2 ⊢ ((𝜑 ∧ 𝐾 = 𝐽) → ¬ (⟨{𝑝 ∣ 𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝐾) ∧ ((𝐹‘𝐽) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝐽, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑆}, {𝑞 ∣ 𝑆 <Q 𝑞}⟩))
8	1, 2, 3, 4, 5	caucvgprprlemnjltk 8011	. 2 ⊢ ((𝜑 ∧ 𝐽 <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		pitri3or 7642	. . 3 ⊢ ((𝐾 ∈ N ∧ 𝐽 ∈ N) → (𝐾 <N 𝐽 ∨ 𝐾 = 𝐽 ∨ 𝐽 <N 𝐾))
10	3, 4, 9	syl2anc 411	. 2 ⊢ (𝜑 → (𝐾 <N 𝐽 ∨ 𝐾 = 𝐽 ∨ 𝐽 <N 𝐾))
11	6, 7, 8, 10	mpjao3dan 1344	1 ⊢ (𝜑 → ¬ (⟨{𝑝 ∣ 𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝐾) ∧ ((𝐹‘𝐽) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝐽, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑆}, {𝑞 ∣ 𝑆 <Q 𝑞}⟩))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ w3o 1004   = wceq 1398   ∈ wcel 2205  {cab 2220  ∀wral 2522  ⟨cop 3694   class class class wbr 4111  ⟶wf 5350  ‘cfv 5354  (class class class)co 6052  1_oc1o 6642  [cec 6767  Ncnpi 7592   <_N clti 7595   ~_Q ceq 7599  Qcnq 7600   +_Q cplq 7602  *_Qcrq 7604   <_Q cltq 7605  Pcnp 7611   +_P cpp 7613  <_P cltp 7615

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712

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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-eprel 4412  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-1o 6649  df-2o 6650  df-oadd 6653  df-omul 6654  df-er 6769  df-ec 6771  df-qs 6775  df-ni 7624  df-pli 7625  df-mi 7626  df-lti 7627  df-plpq 7664  df-mpq 7665  df-enq 7667  df-nqqs 7668  df-plqqs 7669  df-mqqs 7670  df-1nqqs 7671  df-rq 7672  df-ltnqqs 7673  df-enq0 7744  df-nq0 7745  df-0nq0 7746  df-plq0 7747  df-mq0 7748  df-inp 7786  df-iplp 7788  df-iltp 7790

This theorem is referenced by:  caucvgprprlemdisj  8022