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

Theorem addclpr 7868
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 7799 . . . 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 7842 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  ( ~P Q.  X.  ~P Q. ) )
3 addclnq 7706 . . . 4  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y  +Q  z
)  e.  Q. )
41, 3genpml 7848 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. q  e.  Q.  q  e.  ( 1st `  ( A  +P.  B
) ) )
51, 3genpmu 7849 . . 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 7731 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q.  /\  z  e.  Q. )  ->  (
x  <Q  y  <->  ( z  +Q  x )  <Q  (
z  +Q  y ) ) )
8 addcomnqg 7712 . . . . 5  |-  ( ( x  e.  Q.  /\  y  e.  Q. )  ->  ( x  +Q  y
)  =  ( y  +Q  x ) )
9 addnqprl 7860 . . . . 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 7852 . . . 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 7861 . . . . 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 7853 . . . 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 7854 . . 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 7867 . . 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 1204 . 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 7807 . 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 716    /\ w3a 1005    e. wcel 2205   A.wral 2522   E.wrex 2523   ~Pcpw 3674   class class class wbr 4114    X. cxp 4752   ` cfv 5357  (class class class)co 6058   1stc1st 6345   2ndc2nd 6346   Q.cnq 7611    +Q cplq 7613    <Q cltq 7616   P.cnp 7622    +P. cpp 7624
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-iplp 7799
This theorem is referenced by:  addnqprlemfl  7890  addnqprlemfu  7891  addnqpr  7892  addassprg  7910  distrlem1prl  7913  distrlem1pru  7914  distrlem4prl  7915  distrlem4pru  7916  distrprg  7919  ltaddpr  7928  ltexpri  7944  addcanprleml  7945  addcanprlemu  7946  ltaprlem  7949  ltaprg  7950  prplnqu  7951  addextpr  7952  caucvgprlemcanl  7975  cauappcvgprlemladdru  7987  cauappcvgprlemladdrl  7988  cauappcvgprlemladd  7989  cauappcvgprlem1  7990  caucvgprlemladdrl  8009  caucvgprlem1  8010  caucvgprprlemnbj  8024  caucvgprprlemopu  8030  caucvgprprlemloc  8034  caucvgprprlemexbt  8037  caucvgprprlemexb  8038  caucvgprprlemaddq  8039  caucvgprprlem2  8041  enrer  8066  addcmpblnr  8070  mulcmpblnrlemg  8071  mulcmpblnr  8072  ltsrprg  8078  1sr  8082  m1r  8083  addclsr  8084  mulclsr  8085  addasssrg  8087  mulasssrg  8089  distrsrg  8090  m1p1sr  8091  m1m1sr  8092  lttrsr  8093  ltsosr  8095  0lt1sr  8096  0idsr  8098  1idsr  8099  00sr  8100  ltasrg  8101  recexgt0sr  8104  mulgt0sr  8109  aptisr  8110  mulextsr1lem  8111  mulextsr1  8112  archsr  8113  srpospr  8114  prsrcl  8115  prsradd  8117  prsrlt  8118  caucvgsrlemcau  8124  caucvgsrlemgt1  8126  mappsrprg  8135  map2psrprg  8136  pitonnlem1p1  8177  pitonnlem2  8178  pitonn  8179  pitoregt0  8180  pitore  8181  recnnre  8182  recidpirqlemcalc  8188  recidpirq  8189
  Copyright terms: Public domain W3C validator