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

Theorem caucvgprprlemloccalc 7894
Description: Lemma for caucvgprpr 7922. Rearranging some expressions for caucvgprprlemloc 7913. (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
StepHypRef Expression
1 caucvgprprlemloccalc.st . . . . . 6 (𝜑𝑆 <Q 𝑇)
2 ltrelnq 7575 . . . . . . 7 <Q ⊆ (Q × Q)
32brel 4776 . . . . . 6 (𝑆 <Q 𝑇 → (𝑆Q𝑇Q))
41, 3syl 14 . . . . 5 (𝜑 → (𝑆Q𝑇Q))
54simpld 112 . . . 4 (𝜑𝑆Q)
6 caucvgprprlemloccalc.m . . . . 5 (𝜑𝑀N)
7 nnnq 7632 . . . . 5 (𝑀N → [⟨𝑀, 1o⟩] ~QQ)
8 recclnq 7602 . . . . 5 ([⟨𝑀, 1o⟩] ~QQ → (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q)
96, 7, 83syl 17 . . . 4 (𝜑 → (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q)
10 addclnq 7585 . . . 4 ((𝑆Q ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q) → (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q)
115, 9, 10syl2anc 411 . . 3 (𝜑 → (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q)
12 addnqpr 7771 . . 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 𝑢}⟩))
1311, 9, 12syl2anc 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 7592 . . . . 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 ))))
155, 9, 9, 14syl3anc 1271 . . . 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 7614 . . . . . . . . 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 𝑋)))
199, 17, 9, 17, 18syl22anc 1272 . . . . . . . 8 (𝜑 → (((*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋 ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑋) → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋)))
2016, 16, 19mp2and 433 . . . . . . 7 (𝜑 → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋))
21 caucvgprprlemloccalc.xxy . . . . . . 7 (𝜑 → (𝑋 +Q 𝑋) <Q 𝑌)
22 ltsonq 7608 . . . . . . . 8 <Q Or Q
2322, 2sotri 5130 . . . . . . 7 ((((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q (𝑋 +Q 𝑋) ∧ (𝑋 +Q 𝑋) <Q 𝑌) → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑌)
2420, 21, 23syl2anc 411 . . . . . 6 (𝜑 → ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑌)
25 ltanqi 7612 . . . . . 6 ((((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑌𝑆Q) → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q (𝑆 +Q 𝑌))
2624, 5, 25syl2anc 411 . . . . 5 (𝜑 → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q (𝑆 +Q 𝑌))
27 caucvgprprlemloccalc.syt . . . . 5 (𝜑 → (𝑆 +Q 𝑌) = 𝑇)
2826, 27breqtrd 4112 . . . 4 (𝜑 → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q 𝑇)
2915, 28eqbrtrd 4108 . . 3 (𝜑 → ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑇)
30 ltnqpri 7804 . . 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 𝑢}⟩)
3129, 30syl 14 . 2 (𝜑 → ⟨{𝑙𝑙 <Q ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩<P ⟨{𝑙𝑙 <Q 𝑇}, {𝑢𝑇 <Q 𝑢}⟩)
3213, 31eqbrtrrd 4110 1 (𝜑 → (⟨{𝑙𝑙 <Q (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))}, {𝑢 ∣ (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q (*Q‘[⟨𝑀, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑀, 1o⟩] ~Q ) <Q 𝑢}⟩)<P ⟨{𝑙𝑙 <Q 𝑇}, {𝑢𝑇 <Q 𝑢}⟩)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  {cab 2215  cop 3670   class class class wbr 4086  cfv 5324  (class class class)co 6013  1oc1o 6570  [cec 6695  Ncnpi 7482   ~Q ceq 7489  Qcnq 7490   +Q cplq 7492  *Qcrq 7494   <Q cltq 7495   +P cpp 7503  <P cltp 7505
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 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
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 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-eprel 4384  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-1o 6577  df-2o 6578  df-oadd 6581  df-omul 6582  df-er 6697  df-ec 6699  df-qs 6703  df-ni 7514  df-pli 7515  df-mi 7516  df-lti 7517  df-plpq 7554  df-mpq 7555  df-enq 7557  df-nqqs 7558  df-plqqs 7559  df-mqqs 7560  df-1nqqs 7561  df-rq 7562  df-ltnqqs 7563  df-enq0 7634  df-nq0 7635  df-0nq0 7636  df-plq0 7637  df-mq0 7638  df-inp 7676  df-iplp 7678  df-iltp 7680
This theorem is referenced by:  caucvgprprlemloc  7913
  Copyright terms: Public domain W3C validator