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

Theorem caucvgprprlemnkj 7249
Description: Lemma for caucvgprpr 7269. Part of disjointness. (Contributed by Jim Kingdon, 20-Jan-2021.)
Hypotheses
Ref Expression
caucvgprpr.f (𝜑𝐹:NP)
caucvgprpr.cau (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛)<P ((𝐹𝑘) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1𝑜⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹𝑘)<P ((𝐹𝑛) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1𝑜⟩] ~Q ) <Q 𝑢}⟩))))
caucvgprprlemnkj.k (𝜑𝐾N)
caucvgprprlemnkj.j (𝜑𝐽N)
caucvgprprlemnkj.s (𝜑𝑆Q)
Assertion
Ref Expression
caucvgprprlemnkj (𝜑 → ¬ (⟨{𝑝𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝐾) ∧ ((𝐹𝐽) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝐽, 1𝑜⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑆}, {𝑞𝑆 <Q 𝑞}⟩))
Distinct variable groups:   𝑘,𝐹,𝑛   𝐽,𝑝,𝑞   𝑢,𝐽   𝐽,𝑙   𝐾,𝑝,𝑞   𝐾,𝑙   𝑢,𝐾   𝑆,𝑝,𝑞   𝑢,𝑛   𝑛,𝑙,𝑘   𝑢,𝑘   𝑢,𝑞   𝑝,𝑙
Allowed substitution hints:   𝜑(𝑢,𝑘,𝑛,𝑞,𝑝,𝑙)   𝑆(𝑢,𝑘,𝑛,𝑙)   𝐹(𝑢,𝑞,𝑝,𝑙)   𝐽(𝑘,𝑛)   𝐾(𝑘,𝑛)

Proof of Theorem caucvgprprlemnkj
StepHypRef Expression
1 caucvgprpr.f . . 3 (𝜑𝐹:NP)
2 caucvgprpr.cau . . 3 (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐹𝑛)<P ((𝐹𝑘) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1𝑜⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹𝑘)<P ((𝐹𝑛) +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1𝑜⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1𝑜⟩] ~Q ) <Q 𝑢}⟩))))
3 caucvgprprlemnkj.k . . 3 (𝜑𝐾N)
4 caucvgprprlemnkj.j . . 3 (𝜑𝐽N)
5 caucvgprprlemnkj.s . . 3 (𝜑𝑆Q)
61, 2, 3, 4, 5caucvgprprlemnkltj 7246 . 2 ((𝜑𝐾 <N 𝐽) → ¬ (⟨{𝑝𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝐾) ∧ ((𝐹𝐽) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝐽, 1𝑜⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑆}, {𝑞𝑆 <Q 𝑞}⟩))
71, 2, 3, 4, 5caucvgprprlemnkeqj 7247 . 2 ((𝜑𝐾 = 𝐽) → ¬ (⟨{𝑝𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝐾) ∧ ((𝐹𝐽) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝐽, 1𝑜⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑆}, {𝑞𝑆 <Q 𝑞}⟩))
81, 2, 3, 4, 5caucvgprprlemnjltk 7248 . 2 ((𝜑𝐽 <N 𝐾) → ¬ (⟨{𝑝𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝐾) ∧ ((𝐹𝐽) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝐽, 1𝑜⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑆}, {𝑞𝑆 <Q 𝑞}⟩))
9 pitri3or 6879 . . 3 ((𝐾N𝐽N) → (𝐾 <N 𝐽𝐾 = 𝐽𝐽 <N 𝐾))
103, 4, 9syl2anc 403 . 2 (𝜑 → (𝐾 <N 𝐽𝐾 = 𝐽𝐽 <N 𝐾))
116, 7, 8, 10mpjao3dan 1243 1 (𝜑 → ¬ (⟨{𝑝𝑝 <Q (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q ))}, {𝑞 ∣ (𝑆 +Q (*Q‘[⟨𝐾, 1𝑜⟩] ~Q )) <Q 𝑞}⟩<P (𝐹𝐾) ∧ ((𝐹𝐽) +P ⟨{𝑝𝑝 <Q (*Q‘[⟨𝐽, 1𝑜⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝐽, 1𝑜⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝𝑝 <Q 𝑆}, {𝑞𝑆 <Q 𝑞}⟩))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  w3o 923   = wceq 1289  wcel 1438  {cab 2074  wral 2359  cop 3449   class class class wbr 3845  wf 5011  cfv 5015  (class class class)co 5652  1𝑜c1o 6174  [cec 6288  Ncnpi 6829   <N clti 6832   ~Q ceq 6836  Qcnq 6837   +Q cplq 6839  *Qcrq 6841   <Q cltq 6842  Pcnp 6848   +P cpp 6850  <P cltp 6852
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3954  ax-sep 3957  ax-nul 3965  ax-pow 4009  ax-pr 4036  ax-un 4260  ax-setind 4353  ax-iinf 4403
This theorem depends on definitions:  df-bi 115  df-dc 781  df-3or 925  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2841  df-csb 2934  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-nul 3287  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-int 3689  df-iun 3732  df-br 3846  df-opab 3900  df-mpt 3901  df-tr 3937  df-eprel 4116  df-id 4120  df-po 4123  df-iso 4124  df-iord 4193  df-on 4195  df-suc 4198  df-iom 4406  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-f1 5020  df-fo 5021  df-f1o 5022  df-fv 5023  df-ov 5655  df-oprab 5656  df-mpt2 5657  df-1st 5911  df-2nd 5912  df-recs 6070  df-irdg 6135  df-1o 6181  df-2o 6182  df-oadd 6185  df-omul 6186  df-er 6290  df-ec 6292  df-qs 6296  df-ni 6861  df-pli 6862  df-mi 6863  df-lti 6864  df-plpq 6901  df-mpq 6902  df-enq 6904  df-nqqs 6905  df-plqqs 6906  df-mqqs 6907  df-1nqqs 6908  df-rq 6909  df-ltnqqs 6910  df-enq0 6981  df-nq0 6982  df-0nq0 6983  df-plq0 6984  df-mq0 6985  df-inp 7023  df-iplp 7025  df-iltp 7027
This theorem is referenced by:  caucvgprprlemdisj  7259
  Copyright terms: Public domain W3C validator