Theorem caucvgprprlemloccalc 7999

Description: Lemma for caucvgprpr 8027. Rearranging some expressions for caucvgprprlemloc 8018. (Contributed by Jim Kingdon, 8-Feb-2021.)

Hypotheses

Ref	Expression
caucvgprprlemloccalc.st	⊢ (𝜑 → 𝑆 <Q 𝑇)
caucvgprprlemloccalc.y	⊢ (𝜑 → 𝑌 ∈ Q)
caucvgprprlemloccalc.syt	⊢ (𝜑 → (𝑆 +Q 𝑌) = 𝑇)
caucvgprprlemloccalc.x	⊢ (𝜑 → 𝑋 ∈ Q)
caucvgprprlemloccalc.xxy	⊢ (𝜑 → (𝑋 +Q 𝑋) <Q 𝑌)
caucvgprprlemloccalc.m	⊢ (𝜑 → 𝑀 ∈ N)
caucvgprprlemloccalc.mx	⊢ (𝜑 → (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋)

Assertion

Ref	Expression
caucvgprprlemloccalc	⊢ (𝜑 → (⟨{𝑙 ∣ 𝑙 <Q (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑀, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝑇}, {𝑢 ∣ 𝑇 <Q 𝑢}⟩)

Distinct variable groups:   𝑀,𝑙,𝑢   𝑆,𝑙,𝑢   𝑇,𝑙,𝑢

Allowed substitution hints:   𝜑(𝑢,𝑙)   𝑋(𝑢,𝑙)   𝑌(𝑢,𝑙)

Proof of Theorem caucvgprprlemloccalc

Step	Hyp	Ref	Expression
1		caucvgprprlemloccalc.st	. . . . . 6 ⊢ (𝜑 → 𝑆 <Q 𝑇)
2		ltrelnq 7680	. . . . . . 7 ⊢ <Q ⊆ (Q × Q)
3	2	brel 4802	. . . . . 6 ⊢ (𝑆 <Q 𝑇 → (𝑆 ∈ Q ∧ 𝑇 ∈ Q))
4	1, 3	syl 14	. . . . 5 ⊢ (𝜑 → (𝑆 ∈ Q ∧ 𝑇 ∈ Q))
5	4	simpld 112	. . . 4 ⊢ (𝜑 → 𝑆 ∈ Q)
6		caucvgprprlemloccalc.m	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ N)
7		nnnq 7737	. . . . 5 ⊢ (𝑀 ∈ N → [⟨𝑀, 1o⟩] ~Q ∈ Q)
8		recclnq 7707	. . . . 5 ⊢ ([⟨𝑀, 1o⟩] ~Q ∈ Q → (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q)
9	6, 7, 8	3syl 17	. . . 4 ⊢ (𝜑 → (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q)
10		addclnq 7690	. . . 4 ⊢ ((𝑆 ∈ Q ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q) → (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q)
11	5, 9, 10	syl2anc 411	. . 3 ⊢ (𝜑 → (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q)
12		addnqpr 7876	. . 3 ⊢ (((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q) → ⟨{𝑙 ∣ 𝑙 <Q ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑀, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑢}⟩))
13	11, 9, 12	syl2anc 411	. 2 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑀, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑢}⟩))
14		addassnqg 7697	. . . . 5 ⊢ ((𝑆 ∈ Q ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q) → ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) = (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))))
15	5, 9, 9, 14	syl3anc 1274	. . . 4 ⊢ (𝜑 → ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) = (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))))
16		caucvgprprlemloccalc.mx	. . . . . . . 8 ⊢ (𝜑 → (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋)
17		caucvgprprlemloccalc.x	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ Q)
18		lt2addnq 7719	. . . . . . . . 9 ⊢ ((((*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q ∧ 𝑋 ∈ Q) ∧ ((*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q ∧ 𝑋 ∈ Q)) → (((*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋 ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋) → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋)))
19	9, 17, 9, 17, 18	syl22anc 1275	. . . . . . . 8 ⊢ (𝜑 → (((*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋 ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋) → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋)))
20	16, 16, 19	mp2and 433	. . . . . . 7 ⊢ (𝜑 → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋))
21		caucvgprprlemloccalc.xxy	. . . . . . 7 ⊢ (𝜑 → (𝑋 +Q 𝑋) <Q 𝑌)
22		ltsonq 7713	. . . . . . . 8 ⊢ <Q Or Q
23	22, 2	sotri 5158	. . . . . . 7 ⊢ ((((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋) ∧ (𝑋 +Q 𝑋) <Q 𝑌) → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑌)
24	20, 21, 23	syl2anc 411	. . . . . 6 ⊢ (𝜑 → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑌)
25		ltanqi 7717	. . . . . 6 ⊢ ((((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑌 ∧ 𝑆 ∈ Q) → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q (𝑆 +Q 𝑌))
26	24, 5, 25	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q (𝑆 +Q 𝑌))
27		caucvgprprlemloccalc.syt	. . . . 5 ⊢ (𝜑 → (𝑆 +Q 𝑌) = 𝑇)
28	26, 27	breqtrd 4135	. . . 4 ⊢ (𝜑 → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q 𝑇)
29	15, 28	eqbrtrd 4131	. . 3 ⊢ (𝜑 → ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑇)
30		ltnqpri 7909	. . 3 ⊢ (((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑇 → ⟨{𝑙 ∣ 𝑙 <Q ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝑇}, {𝑢 ∣ 𝑇 <Q 𝑢}⟩)
31	29, 30	syl 14	. 2 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝑇}, {𝑢 ∣ 𝑇 <Q 𝑢}⟩)
32	13, 31	eqbrtrrd 4133	1 ⊢ (𝜑 → (⟨{𝑙 ∣ 𝑙 <Q (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑀, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝑇}, {𝑢 ∣ 𝑇 <Q 𝑢}⟩)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2203  {cab 2218  ⟨cop 3692   class class class wbr 4109  ‘cfv 5352  (class class class)co 6050  1_oc1o 6640  [cec 6765  Ncnpi 7587   ~_Q ceq 7594  Qcnq 7595   +_Q cplq 7597  *_Qcrq 7599   <_Q cltq 7600   +_P cpp 7608  <_P cltp 7610

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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710

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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-eprel 4410  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-irdg 6601  df-1o 6647  df-2o 6648  df-oadd 6651  df-omul 6652  df-er 6767  df-ec 6769  df-qs 6773  df-ni 7619  df-pli 7620  df-mi 7621  df-lti 7622  df-plpq 7659  df-mpq 7660  df-enq 7662  df-nqqs 7663  df-plqqs 7664  df-mqqs 7665  df-1nqqs 7666  df-rq 7667  df-ltnqqs 7668  df-enq0 7739  df-nq0 7740  df-0nq0 7741  df-plq0 7742  df-mq0 7743  df-inp 7781  df-iplp 7783  df-iltp 7785

This theorem is referenced by:  caucvgprprlemloc  8018