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

Theorem addclpr 7650
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 7581 . . . 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 7624 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  ( ~P Q.  X.  ~P Q. ) )
3 addclnq 7488 . . . 4  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y  +Q  z
)  e.  Q. )
41, 3genpml 7630 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. q  e.  Q.  q  e.  ( 1st `  ( A  +P.  B
) ) )
51, 3genpmu 7631 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. r  e.  Q.  r  e.  ( 2nd `  ( A  +P.  B
) ) )
62, 4, 5jca32 310 . 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 7513 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q.  /\  z  e.  Q. )  ->  (
x  <Q  y  <->  ( z  +Q  x )  <Q  (
z  +Q  y ) ) )
8 addcomnqg 7494 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q. )  ->  ( x  +Q  y
)  =  ( y  +Q  x ) )
9 addnqprl 7642 . . . . 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 7634 . . . 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 7643 . . . . 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 7635 . . . 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 306 . . 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 7636 . . 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 7649 . . 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 1180 . 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 7589 . 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 417 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 104    <-> wb 105    \/ wo 710    /\ w3a 981    e. wcel 2176   A.wral 2484   E.wrex 2485   ~Pcpw 3616   class class class wbr 4044    X. cxp 4673   ` cfv 5271  (class class class)co 5944   1stc1st 6224   2ndc2nd 6225   Q.cnq 7393    +Q cplq 7395    <Q cltq 7398   P.cnp 7404    +P. cpp 7406
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-eprel 4336  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-irdg 6456  df-1o 6502  df-2o 6503  df-oadd 6506  df-omul 6507  df-er 6620  df-ec 6622  df-qs 6626  df-ni 7417  df-pli 7418  df-mi 7419  df-lti 7420  df-plpq 7457  df-mpq 7458  df-enq 7460  df-nqqs 7461  df-plqqs 7462  df-mqqs 7463  df-1nqqs 7464  df-rq 7465  df-ltnqqs 7466  df-enq0 7537  df-nq0 7538  df-0nq0 7539  df-plq0 7540  df-mq0 7541  df-inp 7579  df-iplp 7581
This theorem is referenced by:  addnqprlemfl  7672  addnqprlemfu  7673  addnqpr  7674  addassprg  7692  distrlem1prl  7695  distrlem1pru  7696  distrlem4prl  7697  distrlem4pru  7698  distrprg  7701  ltaddpr  7710  ltexpri  7726  addcanprleml  7727  addcanprlemu  7728  ltaprlem  7731  ltaprg  7732  prplnqu  7733  addextpr  7734  caucvgprlemcanl  7757  cauappcvgprlemladdru  7769  cauappcvgprlemladdrl  7770  cauappcvgprlemladd  7771  cauappcvgprlem1  7772  caucvgprlemladdrl  7791  caucvgprlem1  7792  caucvgprprlemnbj  7806  caucvgprprlemopu  7812  caucvgprprlemloc  7816  caucvgprprlemexbt  7819  caucvgprprlemexb  7820  caucvgprprlemaddq  7821  caucvgprprlem2  7823  enrer  7848  addcmpblnr  7852  mulcmpblnrlemg  7853  mulcmpblnr  7854  ltsrprg  7860  1sr  7864  m1r  7865  addclsr  7866  mulclsr  7867  addasssrg  7869  mulasssrg  7871  distrsrg  7872  m1p1sr  7873  m1m1sr  7874  lttrsr  7875  ltsosr  7877  0lt1sr  7878  0idsr  7880  1idsr  7881  00sr  7882  ltasrg  7883  recexgt0sr  7886  mulgt0sr  7891  aptisr  7892  mulextsr1lem  7893  mulextsr1  7894  archsr  7895  srpospr  7896  prsrcl  7897  prsradd  7899  prsrlt  7900  caucvgsrlemcau  7906  caucvgsrlemgt1  7908  mappsrprg  7917  map2psrprg  7918  pitonnlem1p1  7959  pitonnlem2  7960  pitonn  7961  pitoregt0  7962  pitore  7963  recnnre  7964  recidpirqlemcalc  7970  recidpirq  7971
  Copyright terms: Public domain W3C validator