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

Theorem addlocprlemgt 7908
Description: Lemma for addlocpr 7910. The (𝐷 +Q 𝐸) <Q 𝑄 case. (Contributed by Jim Kingdon, 6-Dec-2019.)
Hypotheses
Ref Expression
addlocprlem.a (𝜑 → 𝐴 ∈ P)
addlocprlem.b (𝜑 → 𝐵 ∈ P)
addlocprlem.qr (𝜑 → 𝑄 <Q 𝑅)
addlocprlem.p (𝜑 → 𝑃 ∈ Q)
addlocprlem.qppr (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅)
addlocprlem.dlo (𝜑 → 𝐷 ∈ (1st ‘𝐴))
addlocprlem.uup (𝜑 → 𝑈 ∈ (2nd ‘𝐴))
addlocprlem.du (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃))
addlocprlem.elo (𝜑 → 𝐸 ∈ (1st ‘𝐵))
addlocprlem.tup (𝜑 → 𝑇 ∈ (2nd ‘𝐵))
addlocprlem.et (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃))
Assertion
Ref Expression
addlocprlemgt (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))

Proof of Theorem addlocprlemgt
StepHypRef Expression
1 addlocprlem.a . . . . . . 7 (𝜑 → 𝐴 ∈ P)
2 addlocprlem.b . . . . . . 7 (𝜑 → 𝐵 ∈ P)
3 addlocprlem.qr . . . . . . 7 (𝜑 → 𝑄 <Q 𝑅)
4 addlocprlem.p . . . . . . 7 (𝜑 → 𝑃 ∈ Q)
5 addlocprlem.qppr . . . . . . 7 (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅)
6 addlocprlem.dlo . . . . . . 7 (𝜑 → 𝐷 ∈ (1st ‘𝐴))
7 addlocprlem.uup . . . . . . 7 (𝜑 → 𝑈 ∈ (2nd ‘𝐴))
8 addlocprlem.du . . . . . . 7 (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃))
9 addlocprlem.elo . . . . . . 7 (𝜑 → 𝐸 ∈ (1st ‘𝐵))
10 addlocprlem.tup . . . . . . 7 (𝜑 → 𝑇 ∈ (2nd ‘𝐵))
11 addlocprlem.et . . . . . . 7 (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃))
121, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11addlocprlemeqgt 7906 . . . . . 6 (𝜑 → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
1312adantr 276 . . . . 5 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
14 prop 7849 . . . . . . . . . . . 12 (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
151, 14syl 14 . . . . . . . . . . 11 (𝜑 → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
16 elprnql 7855 . . . . . . . . . . 11 ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝐷 ∈ (1st ‘𝐴)) → 𝐷 ∈ Q)
1715, 6, 16syl2anc 415 . . . . . . . . . 10 (𝜑 → 𝐷 ∈ Q)
18 prop 7849 . . . . . . . . . . . 12 (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
192, 18syl 14 . . . . . . . . . . 11 (𝜑 → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
20 elprnql 7855 . . . . . . . . . . 11 ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝐸 ∈ (1st ‘𝐵)) → 𝐸 ∈ Q)
2119, 9, 20syl2anc 415 . . . . . . . . . 10 (𝜑 → 𝐸 ∈ Q)
22 addclnq 7749 . . . . . . . . . 10 ((𝐷 ∈ Q ∧ 𝐸 ∈ Q) → (𝐷 +Q 𝐸) ∈ Q)
2317, 21, 22syl2anc 415 . . . . . . . . 9 (𝜑 → (𝐷 +Q 𝐸) ∈ Q)
24 ltrelnq 7739 . . . . . . . . . . . 12 <Q ⊆ (Q × Q)
2524brel 4829 . . . . . . . . . . 11 (𝑄 <Q 𝑅 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q))
263, 25syl 14 . . . . . . . . . 10 (𝜑 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q))
2726simpld 112 . . . . . . . . 9 (𝜑 → 𝑄 ∈ Q)
28 addclnq 7749 . . . . . . . . . 10 ((𝑃 ∈ Q ∧ 𝑃 ∈ Q) → (𝑃 +Q 𝑃) ∈ Q)
294, 4, 28syl2anc 415 . . . . . . . . 9 (𝜑 → (𝑃 +Q 𝑃) ∈ Q)
30 ltanqg 7774 . . . . . . . . 9 (((𝐷 +Q 𝐸) ∈ Q ∧ 𝑄 ∈ Q ∧ (𝑃 +Q 𝑃) ∈ Q) → ((𝐷 +Q 𝐸) <Q 𝑄 ↔ ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) <Q ((𝑃 +Q 𝑃) +Q 𝑄)))
3123, 27, 29, 30syl3anc 1278 . . . . . . . 8 (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 ↔ ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) <Q ((𝑃 +Q 𝑃) +Q 𝑄)))
32 addcomnqg 7755 . . . . . . . . . 10 (((𝑃 +Q 𝑃) ∈ Q ∧ (𝐷 +Q 𝐸) ∈ Q) → ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
3329, 23, 32syl2anc 415 . . . . . . . . 9 (𝜑 → ((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)))
34 addcomnqg 7755 . . . . . . . . . 10 (((𝑃 +Q 𝑃) ∈ Q ∧ 𝑄 ∈ Q) → ((𝑃 +Q 𝑃) +Q 𝑄) = (𝑄 +Q (𝑃 +Q 𝑃)))
3529, 27, 34syl2anc 415 . . . . . . . . 9 (𝜑 → ((𝑃 +Q 𝑃) +Q 𝑄) = (𝑄 +Q (𝑃 +Q 𝑃)))
3633, 35breq12d 4144 . . . . . . . 8 (𝜑 → (((𝑃 +Q 𝑃) +Q (𝐷 +Q 𝐸)) <Q ((𝑃 +Q 𝑃) +Q 𝑄) ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃))))
3731, 36bitrd 188 . . . . . . 7 (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃))))
3837biimpa 296 . . . . . 6 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃)))
395breq2d 4143 . . . . . . 7 (𝜑 → (((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃)) ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅))
4039adantr 276 . . . . . 6 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → (((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q (𝑄 +Q (𝑃 +Q 𝑃)) ↔ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅))
4138, 40mpbid 147 . . . . 5 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅)
4213, 41jca 306 . . . 4 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) ∧ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅))
43 ltsonq 7772 . . . . 5 <Q Or Q
4443, 24sotri 5186 . . . 4 (((𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) ∧ ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃)) <Q 𝑅) → (𝑈 +Q 𝑇) <Q 𝑅)
4542, 44syl 14 . . 3 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → (𝑈 +Q 𝑇) <Q 𝑅)
461, 7jca 306 . . . . 5 (𝜑 → (𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)))
472, 10jca 306 . . . . 5 (𝜑 → (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵)))
4826simprd 114 . . . . 5 (𝜑 → 𝑅 ∈ Q)
49 addnqpru 7904 . . . . 5 ((((𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) ∧ 𝑅 ∈ Q) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
5046, 47, 48, 49syl21anc 1277 . . . 4 (𝜑 → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
5150adantr 276 . . 3 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
5245, 51mpd 13 . 2 ((𝜑 ∧ (𝐷 +Q 𝐸) <Q 𝑄) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))
5352ex 115 1 (𝜑 → ((𝐷 +Q 𝐸) <Q 𝑄 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ⟨cop 3712   class class class wbr 4131  ‘cfv 5380  (class class class)co 6088  1st c1st 6376  2nd c2nd 6377  Qcnq 7654   +Q cplq 7656   <Q cltq 7659  Pcnp 7665   +P cpp 7667
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7678  df-pli 7679  df-mi 7680  df-lti 7681  df-plpq 7718  df-mpq 7719  df-enq 7721  df-nqqs 7722  df-plqqs 7723  df-mqqs 7724  df-1nqqs 7725  df-rq 7726  df-ltnqqs 7727  df-inp 7840  df-iplp 7842
This theorem is used by:  addlocprlem  7909
  Copyright terms: Public domain W3C validator