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

Theorem caucvgprprlemloccalc 7903
Description: Lemma for caucvgprpr 7931. Rearranging some expressions for caucvgprprlemloc 7922. (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 7584 . . . . . . 7 <Q ⊆ (Q × Q)
32brel 4778 . . . . . 6 (𝑆 <Q 𝑇 → (𝑆Q𝑇Q))
41, 3syl 14 . . . . 5 (𝜑 → (𝑆Q𝑇Q))
54simpld 112 . . . 4 (𝜑𝑆Q)
6 caucvgprprlemloccalc.m . . . . 5 (𝜑𝑀N)
7 nnnq 7641 . . . . 5 (𝑀N → [⟨𝑀, 1o⟩] ~QQ)
8 recclnq 7611 . . . . 5 ([⟨𝑀, 1o⟩] ~QQ → (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q)
96, 7, 83syl 17 . . . 4 (𝜑 → (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q)
10 addclnq 7594 . . . 4 ((𝑆Q ∧ (*Q‘[⟨𝑀, 1o⟩] ~Q ) ∈ Q) → (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q)
115, 9, 10syl2anc 411 . . 3 (𝜑 → (𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) ∈ Q)
12 addnqpr 7780 . . 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 7601 . . . . 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 1273 . . . 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 7623 . . . . . . . . 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 1274 . . . . . . . 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 7617 . . . . . . . 8 <Q Or Q
2322, 2sotri 5132 . . . . . . 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 7621 . . . . . 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 4114 . . . 4 (𝜑 → (𝑆 +Q ((*Q‘[⟨𝑀, 1o⟩] ~Q ) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q ))) <Q 𝑇)
2915, 28eqbrtrd 4110 . . 3 (𝜑 → ((𝑆 +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) +Q (*Q‘[⟨𝑀, 1o⟩] ~Q )) <Q 𝑇)
30 ltnqpri 7813 . . 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 4112 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 1397  wcel 2202  {cab 2217  cop 3672   class class class wbr 4088  cfv 5326  (class class class)co 6017  1oc1o 6574  [cec 6699  Ncnpi 7491   ~Q ceq 7498  Qcnq 7499   +Q cplq 7501  *Qcrq 7503   <Q cltq 7504   +P cpp 7512  <P cltp 7514
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-2o 6582  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-pli 7524  df-mi 7525  df-lti 7526  df-plpq 7563  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-plqqs 7568  df-mqqs 7569  df-1nqqs 7570  df-rq 7571  df-ltnqqs 7572  df-enq0 7643  df-nq0 7644  df-0nq0 7645  df-plq0 7646  df-mq0 7647  df-inp 7685  df-iplp 7687  df-iltp 7689
This theorem is referenced by:  caucvgprprlemloc  7922
  Copyright terms: Public domain W3C validator