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

Theorem addnqpru 7903
Description: Lemma to prove upward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.)
Assertion
Ref Expression
addnqpru  |-  ( ( ( ( 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
) ) ) )

Proof of Theorem addnqpru
Dummy variables  r  q  s  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7848 . . . . . 6  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
2 addnqprulem 7901 . . . . . 6  |-  ( ( ( <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  G  e.  ( 2nd `  A ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  G )  e.  ( 2nd `  A
) ) )
31, 2sylanl1 406 . . . . 5  |-  ( ( ( A  e.  P.  /\  G  e.  ( 2nd `  A ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  G )  e.  ( 2nd `  A
) ) )
43adantlr 481 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  G )  e.  ( 2nd `  A
) ) )
5 prop 7848 . . . . . 6  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
6 addnqprulem 7901 . . . . . 6  |-  ( ( ( <. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  H  e.  ( 2nd `  B ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H )  e.  ( 2nd `  B
) ) )
75, 6sylanl1 406 . . . . 5  |-  ( ( ( B  e.  P.  /\  H  e.  ( 2nd `  B ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H )  e.  ( 2nd `  B
) ) )
87adantll 480 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H )  e.  ( 2nd `  B
) ) )
94, 8jcad 307 . . 3  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  G )  e.  ( 2nd `  A )  /\  ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  H )  e.  ( 2nd `  B ) ) ) )
10 simpl 109 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) ) )
11 simpl 109 . . . . 5  |-  ( ( A  e.  P.  /\  G  e.  ( 2nd `  A ) )  ->  A  e.  P. )
12 simpl 109 . . . . 5  |-  ( ( B  e.  P.  /\  H  e.  ( 2nd `  B ) )  ->  B  e.  P. )
1311, 12anim12i 338 . . . 4  |-  ( ( ( A  e.  P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B ) ) )  ->  ( A  e. 
P.  /\  B  e.  P. ) )
14 df-iplp 7841 . . . . 5  |-  +P.  =  ( x  e.  P. ,  y  e.  P.  |->  <. { q  e.  Q.  |  E. r  e.  Q.  E. s  e.  Q.  (
r  e.  ( 1st `  x )  /\  s  e.  ( 1st `  y
)  /\  q  =  ( r  +Q  s
) ) } ,  { q  e.  Q.  |  E. r  e.  Q.  E. s  e.  Q.  (
r  e.  ( 2nd `  x )  /\  s  e.  ( 2nd `  y
)  /\  q  =  ( r  +Q  s
) ) } >. )
15 addclnq 7748 . . . . 5  |-  ( ( r  e.  Q.  /\  s  e.  Q. )  ->  ( r  +Q  s
)  e.  Q. )
1614, 15genppreclu 7888 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( ( ( X  .Q  ( *Q
`  ( G  +Q  H ) ) )  .Q  G )  e.  ( 2nd `  A
)  /\  ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  H )  e.  ( 2nd `  B ) )  ->  ( (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  G )  +Q  ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) )  e.  ( 2nd `  ( A  +P.  B
) ) ) )
1710, 13, 163syl 17 . . 3  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( ( ( X  .Q  ( *Q
`  ( G  +Q  H ) ) )  .Q  G )  e.  ( 2nd `  A
)  /\  ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  H )  e.  ( 2nd `  B ) )  ->  ( (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  G )  +Q  ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) )  e.  ( 2nd `  ( A  +P.  B
) ) ) )
189, 17syld 45 . 2  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  <Q  X  -> 
( ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  G )  +Q  (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) )  e.  ( 2nd `  ( A  +P.  B ) ) ) )
19 simpr 110 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  X  e.  Q. )
20 elprnqu 7855 . . . . . . . . 9  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  G  e.  ( 2nd `  A ) )  ->  G  e.  Q. )
211, 20sylan 283 . . . . . . . 8  |-  ( ( A  e.  P.  /\  G  e.  ( 2nd `  A ) )  ->  G  e.  Q. )
2221ad2antrr 492 . . . . . . 7  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  G  e.  Q. )
23 elprnqu 7855 . . . . . . . . 9  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  H  e.  ( 2nd `  B ) )  ->  H  e.  Q. )
245, 23sylan 283 . . . . . . . 8  |-  ( ( B  e.  P.  /\  H  e.  ( 2nd `  B ) )  ->  H  e.  Q. )
2524ad2antlr 493 . . . . . . 7  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  H  e.  Q. )
26 addclnq 7748 . . . . . . 7  |-  ( ( G  e.  Q.  /\  H  e.  Q. )  ->  ( G  +Q  H
)  e.  Q. )
2722, 25, 26syl2anc 415 . . . . . 6  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( G  +Q  H
)  e.  Q. )
28 recclnq 7765 . . . . . 6  |-  ( ( G  +Q  H )  e.  Q.  ->  ( *Q `  ( G  +Q  H ) )  e. 
Q. )
2927, 28syl 14 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( *Q `  ( G  +Q  H ) )  e.  Q. )
30 mulassnqg 7757 . . . . 5  |-  ( ( X  e.  Q.  /\  ( *Q `  ( G  +Q  H ) )  e.  Q.  /\  ( G  +Q  H )  e. 
Q. )  ->  (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  ( G  +Q  H ) )  =  ( X  .Q  (
( *Q `  ( G  +Q  H ) )  .Q  ( G  +Q  H ) ) ) )
3119, 29, 27, 30syl3anc 1278 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  ( G  +Q  H ) )  =  ( X  .Q  ( ( *Q `  ( G  +Q  H
) )  .Q  ( G  +Q  H ) ) ) )
32 mulclnq 7749 . . . . . 6  |-  ( ( X  e.  Q.  /\  ( *Q `  ( G  +Q  H ) )  e.  Q. )  -> 
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  e.  Q. )
3319, 29, 32syl2anc 415 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  e.  Q. )
34 distrnqg 7760 . . . . 5  |-  ( ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  e.  Q.  /\  G  e.  Q.  /\  H  e. 
Q. )  ->  (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  ( G  +Q  H ) )  =  ( ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  G )  +Q  (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) ) )
3533, 22, 25, 34syl3anc 1278 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  ( G  +Q  H ) )  =  ( ( ( X  .Q  ( *Q
`  ( G  +Q  H ) ) )  .Q  G )  +Q  ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) ) )
36 mulcomnqg 7756 . . . . . . . 8  |-  ( ( ( *Q `  ( G  +Q  H ) )  e.  Q.  /\  ( G  +Q  H )  e. 
Q. )  ->  (
( *Q `  ( G  +Q  H ) )  .Q  ( G  +Q  H ) )  =  ( ( G  +Q  H )  .Q  ( *Q `  ( G  +Q  H ) ) ) )
3729, 27, 36syl2anc 415 . . . . . . 7  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( *Q `  ( G  +Q  H
) )  .Q  ( G  +Q  H ) )  =  ( ( G  +Q  H )  .Q  ( *Q `  ( G  +Q  H ) ) ) )
38 recidnq 7766 . . . . . . . 8  |-  ( ( G  +Q  H )  e.  Q.  ->  (
( G  +Q  H
)  .Q  ( *Q
`  ( G  +Q  H ) ) )  =  1Q )
3927, 38syl 14 . . . . . . 7  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( G  +Q  H )  .Q  ( *Q `  ( G  +Q  H ) ) )  =  1Q )
4037, 39eqtrd 2271 . . . . . 6  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( *Q `  ( G  +Q  H
) )  .Q  ( G  +Q  H ) )  =  1Q )
4140oveq2d 6104 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( X  .Q  (
( *Q `  ( G  +Q  H ) )  .Q  ( G  +Q  H ) ) )  =  ( X  .Q  1Q ) )
42 mulidnq 7762 . . . . . 6  |-  ( X  e.  Q.  ->  ( X  .Q  1Q )  =  X )
4342adantl 277 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( X  .Q  1Q )  =  X )
4441, 43eqtrd 2271 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( X  .Q  (
( *Q `  ( G  +Q  H ) )  .Q  ( G  +Q  H ) ) )  =  X )
4531, 35, 443eqtr3d 2279 . . 3  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( ( X  .Q  ( *Q `  ( G  +Q  H
) ) )  .Q  G )  +Q  (
( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) )  =  X )
4645eleq1d 2307 . 2  |-  ( ( ( ( A  e. 
P.  /\  G  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  H  e.  ( 2nd `  B
) ) )  /\  X  e.  Q. )  ->  ( ( ( ( X  .Q  ( *Q
`  ( G  +Q  H ) ) )  .Q  G )  +Q  ( ( X  .Q  ( *Q `  ( G  +Q  H ) ) )  .Q  H ) )  e.  ( 2nd `  ( A  +P.  B
) )  <->  X  e.  ( 2nd `  ( A  +P.  B ) ) ) )
4718, 46sylibd 149 1  |-  ( ( ( ( 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
) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   <.cop 3712   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   1stc1st 6376   2ndc2nd 6377   Q.cnq 7653   1Qc1q 7654    +Q cplq 7655    .Q cmq 7656   *Qcrq 7657    <Q cltq 7658   P.cnp 7664    +P. cpp 7666
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-mqqs 7723  df-1nqqs 7724  df-rq 7725  df-ltnqqs 7726  df-inp 7839  df-iplp 7841
This theorem is used by:  addlocprlemeq  7906  addlocprlemgt  7907  addclpr  7910
  Copyright terms: Public domain W3C validator