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

Theorem caucvgprlemcanl 7857
Description: Lemma for cauappcvgprlemladdrl 7870. Cancelling a term from both sides. (Contributed by Jim Kingdon, 15-Aug-2020.)
Hypotheses
Ref Expression
caucvgprlemcanl.l (𝜑𝐿P)
caucvgprlemcanl.s (𝜑𝑆Q)
caucvgprlemcanl.r (𝜑𝑅Q)
caucvgprlemcanl.q (𝜑𝑄Q)
Assertion
Ref Expression
caucvgprlemcanl (𝜑 → ((𝑅 +Q 𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)) ↔ 𝑅 ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩))))
Distinct variable groups:   𝑄,𝑙,𝑢   𝑅,𝑙,𝑢   𝑆,𝑙,𝑢
Allowed substitution hints:   𝜑(𝑢,𝑙)   𝐿(𝑢,𝑙)

Proof of Theorem caucvgprlemcanl
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ltaprg 7832 . . . 4 ((𝑓P𝑔PP) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
21adantl 277 . . 3 ((𝜑 ∧ (𝑓P𝑔PP)) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
3 caucvgprlemcanl.r . . . 4 (𝜑𝑅Q)
4 nqprlu 7760 . . . 4 (𝑅Q → ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ ∈ P)
53, 4syl 14 . . 3 (𝜑 → ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ ∈ P)
6 caucvgprlemcanl.l . . . 4 (𝜑𝐿P)
7 caucvgprlemcanl.s . . . . 5 (𝜑𝑆Q)
8 nqprlu 7760 . . . . 5 (𝑆Q → ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P)
97, 8syl 14 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P)
10 addclpr 7750 . . . 4 ((𝐿P ∧ ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P) → (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) ∈ P)
116, 9, 10syl2anc 411 . . 3 (𝜑 → (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) ∈ P)
12 caucvgprlemcanl.q . . . 4 (𝜑𝑄Q)
13 nqprlu 7760 . . . 4 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
1412, 13syl 14 . . 3 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
15 addcomprg 7791 . . . 4 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1615adantl 277 . . 3 ((𝜑 ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
172, 5, 11, 14, 16caovord2d 6187 . 2 (𝜑 → (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) ↔ (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
18 nqprl 7764 . . 3 ((𝑅Q ∧ (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) ∈ P) → (𝑅 ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩)) ↔ ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩)))
193, 11, 18syl2anc 411 . 2 (𝜑 → (𝑅 ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩)) ↔ ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩)))
20 addnqpr 7774 . . . . 5 ((𝑅Q𝑄Q) → ⟨{𝑙𝑙 <Q (𝑅 +Q 𝑄)}, {𝑢 ∣ (𝑅 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
213, 12, 20syl2anc 411 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q (𝑅 +Q 𝑄)}, {𝑢 ∣ (𝑅 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
22 addnqpr 7774 . . . . . 6 ((𝑆Q𝑄Q) → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
237, 12, 22syl2anc 411 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))
2423oveq2d 6029 . . . 4 (𝜑 → (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
2521, 24breq12d 4099 . . 3 (𝜑 → (⟨{𝑙𝑙 <Q (𝑅 +Q 𝑄)}, {𝑢 ∣ (𝑅 +Q 𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) ↔ (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))))
26 addclnq 7588 . . . . 5 ((𝑅Q𝑄Q) → (𝑅 +Q 𝑄) ∈ Q)
273, 12, 26syl2anc 411 . . . 4 (𝜑 → (𝑅 +Q 𝑄) ∈ Q)
28 addclnq 7588 . . . . . . 7 ((𝑆Q𝑄Q) → (𝑆 +Q 𝑄) ∈ Q)
297, 12, 28syl2anc 411 . . . . . 6 (𝜑 → (𝑆 +Q 𝑄) ∈ Q)
30 nqprlu 7760 . . . . . 6 ((𝑆 +Q 𝑄) ∈ Q → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P)
3129, 30syl 14 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P)
32 addclpr 7750 . . . . 5 ((𝐿P ∧ ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P) → (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) ∈ P)
336, 31, 32syl2anc 411 . . . 4 (𝜑 → (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) ∈ P)
34 nqprl 7764 . . . 4 (((𝑅 +Q 𝑄) ∈ Q ∧ (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) ∈ P) → ((𝑅 +Q 𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)) ↔ ⟨{𝑙𝑙 <Q (𝑅 +Q 𝑄)}, {𝑢 ∣ (𝑅 +Q 𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)))
3527, 33, 34syl2anc 411 . . 3 (𝜑 → ((𝑅 +Q 𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)) ↔ ⟨{𝑙𝑙 <Q (𝑅 +Q 𝑄)}, {𝑢 ∣ (𝑅 +Q 𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)))
36 addassprg 7792 . . . . 5 ((𝐿P ∧ ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
376, 9, 14, 36syl3anc 1271 . . . 4 (𝜑 → ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
3837breq2d 4098 . . 3 (𝜑 → ((⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) ↔ (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩))))
3925, 35, 383bitr4d 220 . 2 (𝜑 → ((𝑅 +Q 𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)) ↔ (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
4017, 19, 393bitr4rd 221 1 (𝜑 → ((𝑅 +Q 𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩)) ↔ 𝑅 ∈ (1st ‘(𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1002   = wceq 1395  wcel 2200  {cab 2215  cop 3670   class class class wbr 4086  cfv 5324  (class class class)co 6013  1st c1st 6296  Qcnq 7493   +Q cplq 7495   <Q cltq 7498  Pcnp 7504   +P cpp 7506  <P cltp 7508
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 7517  df-pli 7518  df-mi 7519  df-lti 7520  df-plpq 7557  df-mpq 7558  df-enq 7560  df-nqqs 7561  df-plqqs 7562  df-mqqs 7563  df-1nqqs 7564  df-rq 7565  df-ltnqqs 7566  df-enq0 7637  df-nq0 7638  df-0nq0 7639  df-plq0 7640  df-mq0 7641  df-inp 7679  df-iplp 7681  df-iltp 7683
This theorem is referenced by:  cauappcvgprlemladdrl  7870  caucvgprlemladdrl  7891
  Copyright terms: Public domain W3C validator