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

Theorem addclpr 6727
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  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  P. )

Proof of Theorem addclpr
Dummy variables  x  y  z  w  v  g  h  q  r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-iplp 6658 . . . 4  |-  +P.  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y  +Q  z
) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y  +Q  z
) ) } >. )
21genpelxp 6701 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  ( ~P Q.  X.  ~P Q. ) )
3 addclnq 6565 . . . 4  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y  +Q  z
)  e.  Q. )
41, 3genpml 6707 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. q  e.  Q.  q  e.  ( 1st `  ( A  +P.  B
) ) )
51, 3genpmu 6708 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. r  e.  Q.  r  e.  ( 2nd `  ( A  +P.  B
) ) )
62, 4, 5jca32 303 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( A  +P.  B )  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  ( A  +P.  B ) )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
7 ltanqg 6590 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q.  /\  z  e.  Q. )  ->  (
x  <Q  y  <->  ( z  +Q  x )  <Q  (
z  +Q  y ) ) )
8 addcomnqg 6571 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q. )  ->  ( x  +Q  y
)  =  ( y  +Q  x ) )
9 addnqprl 6719 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  g  e.  ( 1st `  A ) )  /\  ( B  e.  P.  /\  h  e.  ( 1st `  B
) ) )  /\  x  e.  Q. )  ->  ( x  <Q  (
g  +Q  h )  ->  x  e.  ( 1st `  ( A  +P.  B ) ) ) )
101, 3, 7, 8, 9genprndl 6711 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A. q  e.  Q.  ( q  e.  ( 1st `  ( A  +P.  B ) )  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  ( A  +P.  B ) ) ) ) )
11 addnqpru 6720 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  g  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  h  e.  ( 2nd `  B
) ) )  /\  x  e.  Q. )  ->  ( ( g  +Q  h )  <Q  x  ->  x  e.  ( 2nd `  ( A  +P.  B
) ) ) )
121, 3, 7, 8, 11genprndu 6712 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A. r  e.  Q.  ( r  e.  ( 2nd `  ( A  +P.  B ) )  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
1310, 12jca 300 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A. q  e. 
Q.  ( q  e.  ( 1st `  ( A  +P.  B ) )  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  ( A  +P.  B ) ) ) )  /\  A. r  e. 
Q.  ( r  e.  ( 2nd `  ( A  +P.  B ) )  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) ) ) ) )
141, 3, 7, 8genpdisj 6713 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A. q  e.  Q.  -.  ( q  e.  ( 1st `  ( A  +P.  B ) )  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) ) )
15 addlocpr 6726 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A. q  e.  Q.  A. r  e.  Q.  (
q  <Q  r  ->  (
q  e.  ( 1st `  ( A  +P.  B
) )  \/  r  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
1613, 14, 153jca 1118 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  ( A  +P.  B ) )  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  ( A  +P.  B ) ) ) )  /\  A. r  e. 
Q.  ( r  e.  ( 2nd `  ( A  +P.  B ) )  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )  /\  A. q  e.  Q.  -.  ( q  e.  ( 1st `  ( A  +P.  B ) )  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) )  /\  A. q  e.  Q.  A. r  e. 
Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  ( A  +P.  B ) )  \/  r  e.  ( 2nd `  ( A  +P.  B ) ) ) ) ) )
17 elnp1st2nd 6666 . 2  |-  ( ( A  +P.  B )  e.  P.  <->  ( (
( A  +P.  B
)  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  ( A  +P.  B ) )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  ( A  +P.  B ) ) ) )  /\  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  ( A  +P.  B ) )  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  ( A  +P.  B ) ) ) )  /\  A. r  e. 
Q.  ( r  e.  ( 2nd `  ( A  +P.  B ) )  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )  /\  A. q  e.  Q.  -.  ( q  e.  ( 1st `  ( A  +P.  B ) )  /\  q  e.  ( 2nd `  ( A  +P.  B ) ) )  /\  A. q  e.  Q.  A. r  e. 
Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  ( A  +P.  B ) )  \/  r  e.  ( 2nd `  ( A  +P.  B ) ) ) ) ) ) )
186, 16, 17sylanbrc 408 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  P. )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    <-> wb 103    \/ wo 661    /\ w3a 919    e. wcel 1433   A.wral 2348   E.wrex 2349   ~Pcpw 3382   class class class wbr 3785    X. cxp 4361   ` cfv 4922  (class class class)co 5532   1stc1st 5785   2ndc2nd 5786   Q.cnq 6470    +Q cplq 6472    <Q cltq 6475   P.cnp 6481    +P. cpp 6483
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329
This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-2o 6025  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543  df-enq0 6614  df-nq0 6615  df-0nq0 6616  df-plq0 6617  df-mq0 6618  df-inp 6656  df-iplp 6658
This theorem is referenced by:  addnqprlemfl  6749  addnqprlemfu  6750  addnqpr  6751  addassprg  6769  distrlem1prl  6772  distrlem1pru  6773  distrlem4prl  6774  distrlem4pru  6775  distrprg  6778  ltaddpr  6787  ltexpri  6803  addcanprleml  6804  addcanprlemu  6805  ltaprlem  6808  ltaprg  6809  prplnqu  6810  addextpr  6811  caucvgprlemcanl  6834  cauappcvgprlemladdru  6846  cauappcvgprlemladdrl  6847  cauappcvgprlemladd  6848  cauappcvgprlem1  6849  caucvgprlemladdrl  6868  caucvgprlem1  6869  caucvgprprlemnbj  6883  caucvgprprlemopu  6889  caucvgprprlemloc  6893  caucvgprprlemexbt  6896  caucvgprprlemexb  6897  caucvgprprlemaddq  6898  caucvgprprlem2  6900  enrer  6912  addcmpblnr  6916  mulcmpblnrlemg  6917  mulcmpblnr  6918  ltsrprg  6924  1sr  6928  m1r  6929  addclsr  6930  mulclsr  6931  addasssrg  6933  mulasssrg  6935  distrsrg  6936  m1p1sr  6937  m1m1sr  6938  lttrsr  6939  ltsosr  6941  0lt1sr  6942  0idsr  6944  1idsr  6945  00sr  6946  ltasrg  6947  recexgt0sr  6950  mulgt0sr  6954  aptisr  6955  mulextsr1lem  6956  mulextsr1  6957  archsr  6958  srpospr  6959  prsrcl  6960  prsradd  6962  prsrlt  6963  caucvgsrlemcau  6969  caucvgsrlemgt1  6971  pitonnlem1p1  7014  pitonnlem2  7015  pitonn  7016  pitoregt0  7017  pitore  7018  recnnre  7019  recidpirqlemcalc  7025  recidpirq  7026
  Copyright terms: Public domain W3C validator