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

Theorem addclpr 7720
Description: Closure of addition on positive reals. First statement of Proposition 9-3.5 of [Gleason] p. 123. Combination of Lemma 11.13 and Lemma 11.16 in [BauerTaylor], p. 53. (Contributed by NM, 13-Mar-1996.)
Assertion
Ref Expression
addclpr ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)

Proof of Theorem addclpr
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑔 𝑞 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-iplp 7651 . . . 4 +P = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦 +Q 𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦 +Q 𝑧))}⟩)
21genpelxp 7694 . . 3 ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ (𝒫 Q × 𝒫 Q))
3 addclnq 7558 . . . 4 ((𝑦Q𝑧Q) → (𝑦 +Q 𝑧) ∈ Q)
41, 3genpml 7700 . . 3 ((𝐴P𝐵P) → ∃𝑞Q 𝑞 ∈ (1st ‘(𝐴 +P 𝐵)))
51, 3genpmu 7701 . . 3 ((𝐴P𝐵P) → ∃𝑟Q 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))
62, 4, 5jca32 310 . 2 ((𝐴P𝐵P) → ((𝐴 +P 𝐵) ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∧ ∃𝑟Q 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
7 ltanqg 7583 . . . . 5 ((𝑥Q𝑦Q𝑧Q) → (𝑥 <Q 𝑦 ↔ (𝑧 +Q 𝑥) <Q (𝑧 +Q 𝑦)))
8 addcomnqg 7564 . . . . 5 ((𝑥Q𝑦Q) → (𝑥 +Q 𝑦) = (𝑦 +Q 𝑥))
9 addnqprl 7712 . . . . 5 ((((𝐴P𝑔 ∈ (1st𝐴)) ∧ (𝐵P ∈ (1st𝐵))) ∧ 𝑥Q) → (𝑥 <Q (𝑔 +Q ) → 𝑥 ∈ (1st ‘(𝐴 +P 𝐵))))
101, 3, 7, 8, 9genprndl 7704 . . . 4 ((𝐴P𝐵P) → ∀𝑞Q (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st ‘(𝐴 +P 𝐵)))))
11 addnqpru 7713 . . . . 5 ((((𝐴P𝑔 ∈ (2nd𝐴)) ∧ (𝐵P ∈ (2nd𝐵))) ∧ 𝑥Q) → ((𝑔 +Q ) <Q 𝑥𝑥 ∈ (2nd ‘(𝐴 +P 𝐵))))
121, 3, 7, 8, 11genprndu 7705 . . . 4 ((𝐴P𝐵P) → ∀𝑟Q (𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd ‘(𝐴 +P 𝐵)))))
1310, 12jca 306 . . 3 ((𝐴P𝐵P) → (∀𝑞Q (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st ‘(𝐴 +P 𝐵)))) ∧ ∀𝑟Q (𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd ‘(𝐴 +P 𝐵))))))
141, 3, 7, 8genpdisj 7706 . . 3 ((𝐴P𝐵P) → ∀𝑞Q ¬ (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴 +P 𝐵))))
15 addlocpr 7719 . . 3 ((𝐴P𝐵P) → ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))
1613, 14, 153jca 1201 . 2 ((𝐴P𝐵P) → ((∀𝑞Q (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st ‘(𝐴 +P 𝐵)))) ∧ ∀𝑟Q (𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd ‘(𝐴 +P 𝐵))))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴 +P 𝐵))) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵))))))
17 elnp1st2nd 7659 . 2 ((𝐴 +P 𝐵) ∈ P ↔ (((𝐴 +P 𝐵) ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∧ ∃𝑟Q 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))) ∧ ((∀𝑞Q (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st ‘(𝐴 +P 𝐵)))) ∧ ∀𝑟Q (𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd ‘(𝐴 +P 𝐵))))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴 +P 𝐵))) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘(𝐴 +P 𝐵)) ∨ 𝑟 ∈ (2nd ‘(𝐴 +P 𝐵)))))))
186, 16, 17sylanbrc 417 1 ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 713  w3a 1002  wcel 2200  wral 2508  wrex 2509  𝒫 cpw 3649   class class class wbr 4082   × cxp 4716  cfv 5317  (class class class)co 6000  1st c1st 6282  2nd c2nd 6283  Qcnq 7463   +Q cplq 7465   <Q cltq 7468  Pcnp 7474   +P cpp 7476
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 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679
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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-eprel 4379  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-irdg 6514  df-1o 6560  df-2o 6561  df-oadd 6564  df-omul 6565  df-er 6678  df-ec 6680  df-qs 6684  df-ni 7487  df-pli 7488  df-mi 7489  df-lti 7490  df-plpq 7527  df-mpq 7528  df-enq 7530  df-nqqs 7531  df-plqqs 7532  df-mqqs 7533  df-1nqqs 7534  df-rq 7535  df-ltnqqs 7536  df-enq0 7607  df-nq0 7608  df-0nq0 7609  df-plq0 7610  df-mq0 7611  df-inp 7649  df-iplp 7651
This theorem is referenced by:  addnqprlemfl  7742  addnqprlemfu  7743  addnqpr  7744  addassprg  7762  distrlem1prl  7765  distrlem1pru  7766  distrlem4prl  7767  distrlem4pru  7768  distrprg  7771  ltaddpr  7780  ltexpri  7796  addcanprleml  7797  addcanprlemu  7798  ltaprlem  7801  ltaprg  7802  prplnqu  7803  addextpr  7804  caucvgprlemcanl  7827  cauappcvgprlemladdru  7839  cauappcvgprlemladdrl  7840  cauappcvgprlemladd  7841  cauappcvgprlem1  7842  caucvgprlemladdrl  7861  caucvgprlem1  7862  caucvgprprlemnbj  7876  caucvgprprlemopu  7882  caucvgprprlemloc  7886  caucvgprprlemexbt  7889  caucvgprprlemexb  7890  caucvgprprlemaddq  7891  caucvgprprlem2  7893  enrer  7918  addcmpblnr  7922  mulcmpblnrlemg  7923  mulcmpblnr  7924  ltsrprg  7930  1sr  7934  m1r  7935  addclsr  7936  mulclsr  7937  addasssrg  7939  mulasssrg  7941  distrsrg  7942  m1p1sr  7943  m1m1sr  7944  lttrsr  7945  ltsosr  7947  0lt1sr  7948  0idsr  7950  1idsr  7951  00sr  7952  ltasrg  7953  recexgt0sr  7956  mulgt0sr  7961  aptisr  7962  mulextsr1lem  7963  mulextsr1  7964  archsr  7965  srpospr  7966  prsrcl  7967  prsradd  7969  prsrlt  7970  caucvgsrlemcau  7976  caucvgsrlemgt1  7978  mappsrprg  7987  map2psrprg  7988  pitonnlem1p1  8029  pitonnlem2  8030  pitonn  8031  pitoregt0  8032  pitore  8033  recnnre  8034  recidpirqlemcalc  8040  recidpirq  8041
  Copyright terms: Public domain W3C validator