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

Theorem addnqpru 7543
Description: Lemma to prove upward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.)
Assertion
Ref Expression
addnqpru ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋𝑋 ∈ (2nd ‘(𝐴 +P 𝐵))))

Proof of Theorem addnqpru
Dummy variables 𝑟 𝑞 𝑠 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7488 . . . . . 6 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
2 addnqprulem 7541 . . . . . 6 (((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝐺 ∈ (2nd𝐴)) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) ∈ (2nd𝐴)))
31, 2sylanl1 402 . . . . 5 (((𝐴P𝐺 ∈ (2nd𝐴)) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) ∈ (2nd𝐴)))
43adantlr 477 . . . 4 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) ∈ (2nd𝐴)))
5 prop 7488 . . . . . 6 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
6 addnqprulem 7541 . . . . . 6 (((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝐻 ∈ (2nd𝐵)) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻) ∈ (2nd𝐵)))
75, 6sylanl1 402 . . . . 5 (((𝐵P𝐻 ∈ (2nd𝐵)) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻) ∈ (2nd𝐵)))
87adantll 476 . . . 4 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻) ∈ (2nd𝐵)))
94, 8jcad 307 . . 3 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) ∈ (2nd𝐴) ∧ ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻) ∈ (2nd𝐵))))
10 simpl 109 . . . 4 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))))
11 simpl 109 . . . . 5 ((𝐴P𝐺 ∈ (2nd𝐴)) → 𝐴P)
12 simpl 109 . . . . 5 ((𝐵P𝐻 ∈ (2nd𝐵)) → 𝐵P)
1311, 12anim12i 338 . . . 4 (((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) → (𝐴P𝐵P))
14 df-iplp 7481 . . . . 5 +P = (𝑥P, 𝑦P ↦ ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑥) ∧ 𝑠 ∈ (1st𝑦) ∧ 𝑞 = (𝑟 +Q 𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑥) ∧ 𝑠 ∈ (2nd𝑦) ∧ 𝑞 = (𝑟 +Q 𝑠))}⟩)
15 addclnq 7388 . . . . 5 ((𝑟Q𝑠Q) → (𝑟 +Q 𝑠) ∈ Q)
1614, 15genppreclu 7528 . . . 4 ((𝐴P𝐵P) → ((((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) ∈ (2nd𝐴) ∧ ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻) ∈ (2nd𝐵)) → (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)) ∈ (2nd ‘(𝐴 +P 𝐵))))
1710, 13, 163syl 17 . . 3 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) ∈ (2nd𝐴) ∧ ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻) ∈ (2nd𝐵)) → (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)) ∈ (2nd ‘(𝐴 +P 𝐵))))
189, 17syld 45 . 2 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋 → (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)) ∈ (2nd ‘(𝐴 +P 𝐵))))
19 simpr 110 . . . . 5 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → 𝑋Q)
20 elprnqu 7495 . . . . . . . . 9 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝐺 ∈ (2nd𝐴)) → 𝐺Q)
211, 20sylan 283 . . . . . . . 8 ((𝐴P𝐺 ∈ (2nd𝐴)) → 𝐺Q)
2221ad2antrr 488 . . . . . . 7 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → 𝐺Q)
23 elprnqu 7495 . . . . . . . . 9 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝐻 ∈ (2nd𝐵)) → 𝐻Q)
245, 23sylan 283 . . . . . . . 8 ((𝐵P𝐻 ∈ (2nd𝐵)) → 𝐻Q)
2524ad2antlr 489 . . . . . . 7 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → 𝐻Q)
26 addclnq 7388 . . . . . . 7 ((𝐺Q𝐻Q) → (𝐺 +Q 𝐻) ∈ Q)
2722, 25, 26syl2anc 411 . . . . . 6 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (𝐺 +Q 𝐻) ∈ Q)
28 recclnq 7405 . . . . . 6 ((𝐺 +Q 𝐻) ∈ Q → (*Q‘(𝐺 +Q 𝐻)) ∈ Q)
2927, 28syl 14 . . . . 5 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (*Q‘(𝐺 +Q 𝐻)) ∈ Q)
30 mulassnqg 7397 . . . . 5 ((𝑋Q ∧ (*Q‘(𝐺 +Q 𝐻)) ∈ Q ∧ (𝐺 +Q 𝐻) ∈ Q) → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q (𝐺 +Q 𝐻)) = (𝑋 ·Q ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻))))
3119, 29, 27, 30syl3anc 1248 . . . 4 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q (𝐺 +Q 𝐻)) = (𝑋 ·Q ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻))))
32 mulclnq 7389 . . . . . 6 ((𝑋Q ∧ (*Q‘(𝐺 +Q 𝐻)) ∈ Q) → (𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ∈ Q)
3319, 29, 32syl2anc 411 . . . . 5 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ∈ Q)
34 distrnqg 7400 . . . . 5 (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ∈ Q𝐺Q𝐻Q) → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q (𝐺 +Q 𝐻)) = (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)))
3533, 22, 25, 34syl3anc 1248 . . . 4 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q (𝐺 +Q 𝐻)) = (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)))
36 mulcomnqg 7396 . . . . . . . 8 (((*Q‘(𝐺 +Q 𝐻)) ∈ Q ∧ (𝐺 +Q 𝐻) ∈ Q) → ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻)) = ((𝐺 +Q 𝐻) ·Q (*Q‘(𝐺 +Q 𝐻))))
3729, 27, 36syl2anc 411 . . . . . . 7 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻)) = ((𝐺 +Q 𝐻) ·Q (*Q‘(𝐺 +Q 𝐻))))
38 recidnq 7406 . . . . . . . 8 ((𝐺 +Q 𝐻) ∈ Q → ((𝐺 +Q 𝐻) ·Q (*Q‘(𝐺 +Q 𝐻))) = 1Q)
3927, 38syl 14 . . . . . . 7 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) ·Q (*Q‘(𝐺 +Q 𝐻))) = 1Q)
4037, 39eqtrd 2220 . . . . . 6 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻)) = 1Q)
4140oveq2d 5904 . . . . 5 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (𝑋 ·Q ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻))) = (𝑋 ·Q 1Q))
42 mulidnq 7402 . . . . . 6 (𝑋Q → (𝑋 ·Q 1Q) = 𝑋)
4342adantl 277 . . . . 5 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (𝑋 ·Q 1Q) = 𝑋)
4441, 43eqtrd 2220 . . . 4 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (𝑋 ·Q ((*Q‘(𝐺 +Q 𝐻)) ·Q (𝐺 +Q 𝐻))) = 𝑋)
4531, 35, 443eqtr3d 2228 . . 3 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → (((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)) = 𝑋)
4645eleq1d 2256 . 2 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐺) +Q ((𝑋 ·Q (*Q‘(𝐺 +Q 𝐻))) ·Q 𝐻)) ∈ (2nd ‘(𝐴 +P 𝐵)) ↔ 𝑋 ∈ (2nd ‘(𝐴 +P 𝐵))))
4718, 46sylibd 149 1 ((((𝐴P𝐺 ∈ (2nd𝐴)) ∧ (𝐵P𝐻 ∈ (2nd𝐵))) ∧ 𝑋Q) → ((𝐺 +Q 𝐻) <Q 𝑋𝑋 ∈ (2nd ‘(𝐴 +P 𝐵))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1363  wcel 2158  cop 3607   class class class wbr 4015  cfv 5228  (class class class)co 5888  1st c1st 6153  2nd c2nd 6154  Qcnq 7293  1Qc1q 7294   +Q cplq 7295   ·Q cmq 7296  *Qcrq 7297   <Q cltq 7298  Pcnp 7304   +P cpp 7306
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-eprel 4301  df-id 4305  df-iord 4378  df-on 4380  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6155  df-2nd 6156  df-recs 6320  df-irdg 6385  df-1o 6431  df-oadd 6435  df-omul 6436  df-er 6549  df-ec 6551  df-qs 6555  df-ni 7317  df-pli 7318  df-mi 7319  df-lti 7320  df-plpq 7357  df-mpq 7358  df-enq 7360  df-nqqs 7361  df-plqqs 7362  df-mqqs 7363  df-1nqqs 7364  df-rq 7365  df-ltnqqs 7366  df-inp 7479  df-iplp 7481
This theorem is referenced by:  addlocprlemeq  7546  addlocprlemgt  7547  addclpr  7550
  Copyright terms: Public domain W3C validator