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

Theorem caucvgprlemcanl 7869
Description: Lemma for cauappcvgprlemladdrl 7882. 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 7844 . . . 4 ((𝑓P𝑔PP) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
21adantl 277 . . 3 ((𝜑 ∧ (𝑓P𝑔PP)) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
3 caucvgprlemcanl.r . . . 4 (𝜑𝑅Q)
4 nqprlu 7772 . . . 4 (𝑅Q → ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ ∈ P)
53, 4syl 14 . . 3 (𝜑 → ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ ∈ P)
6 caucvgprlemcanl.l . . . 4 (𝜑𝐿P)
7 caucvgprlemcanl.s . . . . 5 (𝜑𝑆Q)
8 nqprlu 7772 . . . . 5 (𝑆Q → ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P)
97, 8syl 14 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P)
10 addclpr 7762 . . . 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 7772 . . . 4 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
1412, 13syl 14 . . 3 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
15 addcomprg 7803 . . . 4 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1615adantl 277 . . 3 ((𝜑 ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
172, 5, 11, 14, 16caovord2d 6197 . 2 (𝜑 → (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) ↔ (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
18 nqprl 7776 . . 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 7786 . . . . 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 7786 . . . . . 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 6039 . . . 4 (𝜑 → (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
2521, 24breq12d 4102 . . 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 7600 . . . . 5 ((𝑅Q𝑄Q) → (𝑅 +Q 𝑄) ∈ Q)
273, 12, 26syl2anc 411 . . . 4 (𝜑 → (𝑅 +Q 𝑄) ∈ Q)
28 addclnq 7600 . . . . . . 7 ((𝑆Q𝑄Q) → (𝑆 +Q 𝑄) ∈ Q)
297, 12, 28syl2anc 411 . . . . . 6 (𝜑 → (𝑆 +Q 𝑄) ∈ Q)
30 nqprlu 7772 . . . . . 6 ((𝑆 +Q 𝑄) ∈ Q → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P)
3129, 30syl 14 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P)
32 addclpr 7762 . . . . 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 7776 . . . 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 7804 . . . . 5 ((𝐿P ∧ ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
376, 9, 14, 36syl3anc 1273 . . . 4 (𝜑 → ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
3837breq2d 4101 . . 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 1004   = wceq 1397  wcel 2201  {cab 2216  cop 3673   class class class wbr 4089  cfv 5328  (class class class)co 6023  1st c1st 6306  Qcnq 7505   +Q cplq 7507   <Q cltq 7510  Pcnp 7516   +P cpp 7518  <P cltp 7520
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 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-iinf 4688
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 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-tr 4189  df-eprel 4388  df-id 4392  df-po 4395  df-iso 4396  df-iord 4465  df-on 4467  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-recs 6476  df-irdg 6541  df-1o 6587  df-2o 6588  df-oadd 6591  df-omul 6592  df-er 6707  df-ec 6709  df-qs 6713  df-ni 7529  df-pli 7530  df-mi 7531  df-lti 7532  df-plpq 7569  df-mpq 7570  df-enq 7572  df-nqqs 7573  df-plqqs 7574  df-mqqs 7575  df-1nqqs 7576  df-rq 7577  df-ltnqqs 7578  df-enq0 7649  df-nq0 7650  df-0nq0 7651  df-plq0 7652  df-mq0 7653  df-inp 7691  df-iplp 7693  df-iltp 7695
This theorem is referenced by:  cauappcvgprlemladdrl  7882  caucvgprlemladdrl  7903
  Copyright terms: Public domain W3C validator