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

Theorem caucvgprlemcanl 7955
Description: Lemma for cauappcvgprlemladdrl 7968. 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 7930 . . . 4 ((𝑓P𝑔PP) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
21adantl 277 . . 3 ((𝜑 ∧ (𝑓P𝑔PP)) → (𝑓<P 𝑔 ↔ ( +P 𝑓)<P ( +P 𝑔)))
3 caucvgprlemcanl.r . . . 4 (𝜑𝑅Q)
4 nqprlu 7858 . . . 4 (𝑅Q → ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ ∈ P)
53, 4syl 14 . . 3 (𝜑 → ⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ ∈ P)
6 caucvgprlemcanl.l . . . 4 (𝜑𝐿P)
7 caucvgprlemcanl.s . . . . 5 (𝜑𝑆Q)
8 nqprlu 7858 . . . . 5 (𝑆Q → ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P)
97, 8syl 14 . . . 4 (𝜑 → ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P)
10 addclpr 7848 . . . 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 7858 . . . 4 (𝑄Q → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
1412, 13syl 14 . . 3 (𝜑 → ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P)
15 addcomprg 7889 . . . 4 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1615adantl 277 . . 3 ((𝜑 ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
172, 5, 11, 14, 16caovord2d 6223 . 2 (𝜑 → (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) ↔ (⟨{𝑙𝑙 <Q 𝑅}, {𝑢𝑅 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)<P ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
18 nqprl 7862 . . 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 7872 . . . . 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 7872 . . . . . 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 6065 . . . 4 (𝜑 → (𝐿 +P ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
2521, 24breq12d 4121 . . 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 7686 . . . . 5 ((𝑅Q𝑄Q) → (𝑅 +Q 𝑄) ∈ Q)
273, 12, 26syl2anc 411 . . . 4 (𝜑 → (𝑅 +Q 𝑄) ∈ Q)
28 addclnq 7686 . . . . . . 7 ((𝑆Q𝑄Q) → (𝑆 +Q 𝑄) ∈ Q)
297, 12, 28syl2anc 411 . . . . . 6 (𝜑 → (𝑆 +Q 𝑄) ∈ Q)
30 nqprlu 7858 . . . . . 6 ((𝑆 +Q 𝑄) ∈ Q → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P)
3129, 30syl 14 . . . . 5 (𝜑 → ⟨{𝑙𝑙 <Q (𝑆 +Q 𝑄)}, {𝑢 ∣ (𝑆 +Q 𝑄) <Q 𝑢}⟩ ∈ P)
32 addclpr 7848 . . . . 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 7862 . . . 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 7890 . . . . 5 ((𝐿P ∧ ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩ ∈ P) → ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
376, 9, 14, 36syl3anc 1274 . . . 4 (𝜑 → ((𝐿 +P ⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩) +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩) = (𝐿 +P (⟨{𝑙𝑙 <Q 𝑆}, {𝑢𝑆 <Q 𝑢}⟩ +P ⟨{𝑙𝑙 <Q 𝑄}, {𝑢𝑄 <Q 𝑢}⟩)))
3837breq2d 4120 . . 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 1005   = wceq 1398  wcel 2203  {cab 2218  cop 3691   class class class wbr 4108  cfv 5351  (class class class)co 6049  1st c1st 6331  Qcnq 7591   +Q cplq 7593   <Q cltq 7596  Pcnp 7602   +P cpp 7604  <P cltp 7606
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 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709
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 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-2o 6647  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7615  df-pli 7616  df-mi 7617  df-lti 7618  df-plpq 7655  df-mpq 7656  df-enq 7658  df-nqqs 7659  df-plqqs 7660  df-mqqs 7661  df-1nqqs 7662  df-rq 7663  df-ltnqqs 7664  df-enq0 7735  df-nq0 7736  df-0nq0 7737  df-plq0 7738  df-mq0 7739  df-inp 7777  df-iplp 7779  df-iltp 7781
This theorem is referenced by:  cauappcvgprlemladdrl  7968  caucvgprlemladdrl  7989
  Copyright terms: Public domain W3C validator