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

Theorem divalglemnqt 12471
Description: Lemma for divalg 12475. The  Q  <  T case involved in showing uniqueness. (Contributed by Jim Kingdon, 4-Dec-2021.)
Hypotheses
Ref Expression
divalglemnqt.d  |-  ( ph  ->  D  e.  NN )
divalglemnqt.r  |-  ( ph  ->  R  e.  ZZ )
divalglemnqt.s  |-  ( ph  ->  S  e.  ZZ )
divalglemnqt.q  |-  ( ph  ->  Q  e.  ZZ )
divalglemnqt.t  |-  ( ph  ->  T  e.  ZZ )
divalglemnqt.0s  |-  ( ph  ->  0  <_  S )
divalglemnqt.rd  |-  ( ph  ->  R  <  D )
divalglemnqt.eq  |-  ( ph  ->  ( ( Q  x.  D )  +  R
)  =  ( ( T  x.  D )  +  S ) )
Assertion
Ref Expression
divalglemnqt  |-  ( ph  ->  -.  Q  <  T
)

Proof of Theorem divalglemnqt
StepHypRef Expression
1 divalglemnqt.rd . . 3  |-  ( ph  ->  R  <  D )
21adantr 276 . 2  |-  ( (
ph  /\  Q  <  T )  ->  R  <  D )
3 divalglemnqt.d . . . . 5  |-  ( ph  ->  D  e.  NN )
43adantr 276 . . . 4  |-  ( (
ph  /\  Q  <  T )  ->  D  e.  NN )
54nnred 9146 . . 3  |-  ( (
ph  /\  Q  <  T )  ->  D  e.  RR )
6 divalglemnqt.r . . . . 5  |-  ( ph  ->  R  e.  ZZ )
76adantr 276 . . . 4  |-  ( (
ph  /\  Q  <  T )  ->  R  e.  ZZ )
87zred 9592 . . 3  |-  ( (
ph  /\  Q  <  T )  ->  R  e.  RR )
9 divalglemnqt.s . . . . . . 7  |-  ( ph  ->  S  e.  ZZ )
109adantr 276 . . . . . 6  |-  ( (
ph  /\  Q  <  T )  ->  S  e.  ZZ )
1110zred 9592 . . . . 5  |-  ( (
ph  /\  Q  <  T )  ->  S  e.  RR )
125, 11readdcld 8199 . . . 4  |-  ( (
ph  /\  Q  <  T )  ->  ( D  +  S )  e.  RR )
13 divalglemnqt.0s . . . . . 6  |-  ( ph  ->  0  <_  S )
1413adantr 276 . . . . 5  |-  ( (
ph  /\  Q  <  T )  ->  0  <_  S )
155, 11addge01d 8703 . . . . 5  |-  ( (
ph  /\  Q  <  T )  ->  ( 0  <_  S  <->  D  <_  ( D  +  S ) ) )
1614, 15mpbid 147 . . . 4  |-  ( (
ph  /\  Q  <  T )  ->  D  <_  ( D  +  S ) )
17 divalglemnqt.q . . . . . . . . . . 11  |-  ( ph  ->  Q  e.  ZZ )
1817adantr 276 . . . . . . . . . 10  |-  ( (
ph  /\  Q  <  T )  ->  Q  e.  ZZ )
1918zred 9592 . . . . . . . . 9  |-  ( (
ph  /\  Q  <  T )  ->  Q  e.  RR )
2019recnd 8198 . . . . . . . 8  |-  ( (
ph  /\  Q  <  T )  ->  Q  e.  CC )
215recnd 8198 . . . . . . . 8  |-  ( (
ph  /\  Q  <  T )  ->  D  e.  CC )
2220, 21mulcld 8190 . . . . . . 7  |-  ( (
ph  /\  Q  <  T )  ->  ( Q  x.  D )  e.  CC )
2311recnd 8198 . . . . . . 7  |-  ( (
ph  /\  Q  <  T )  ->  S  e.  CC )
2422, 21, 23addassd 8192 . . . . . 6  |-  ( (
ph  /\  Q  <  T )  ->  ( (
( Q  x.  D
)  +  D )  +  S )  =  ( ( Q  x.  D )  +  ( D  +  S ) ) )
2519, 5remulcld 8200 . . . . . . . . 9  |-  ( (
ph  /\  Q  <  T )  ->  ( Q  x.  D )  e.  RR )
2625, 5readdcld 8199 . . . . . . . 8  |-  ( (
ph  /\  Q  <  T )  ->  ( ( Q  x.  D )  +  D )  e.  RR )
27 divalglemnqt.t . . . . . . . . . . 11  |-  ( ph  ->  T  e.  ZZ )
2827adantr 276 . . . . . . . . . 10  |-  ( (
ph  /\  Q  <  T )  ->  T  e.  ZZ )
2928zred 9592 . . . . . . . . 9  |-  ( (
ph  /\  Q  <  T )  ->  T  e.  RR )
3029, 5remulcld 8200 . . . . . . . 8  |-  ( (
ph  /\  Q  <  T )  ->  ( T  x.  D )  e.  RR )
3120, 21adddirp1d 8196 . . . . . . . . 9  |-  ( (
ph  /\  Q  <  T )  ->  ( ( Q  +  1 )  x.  D )  =  ( ( Q  x.  D )  +  D
) )
32 peano2re 8305 . . . . . . . . . . 11  |-  ( Q  e.  RR  ->  ( Q  +  1 )  e.  RR )
3319, 32syl 14 . . . . . . . . . 10  |-  ( (
ph  /\  Q  <  T )  ->  ( Q  +  1 )  e.  RR )
344nnnn0d 9445 . . . . . . . . . . 11  |-  ( (
ph  /\  Q  <  T )  ->  D  e.  NN0 )
3534nn0ge0d 9448 . . . . . . . . . 10  |-  ( (
ph  /\  Q  <  T )  ->  0  <_  D )
36 simpr 110 . . . . . . . . . . 11  |-  ( (
ph  /\  Q  <  T )  ->  Q  <  T )
37 zltp1le 9524 . . . . . . . . . . . 12  |-  ( ( Q  e.  ZZ  /\  T  e.  ZZ )  ->  ( Q  <  T  <->  ( Q  +  1 )  <_  T ) )
3817, 28, 37syl2an2r 597 . . . . . . . . . . 11  |-  ( (
ph  /\  Q  <  T )  ->  ( Q  <  T  <->  ( Q  + 
1 )  <_  T
) )
3936, 38mpbid 147 . . . . . . . . . 10  |-  ( (
ph  /\  Q  <  T )  ->  ( Q  +  1 )  <_  T )
4033, 29, 5, 35, 39lemul1ad 9109 . . . . . . . . 9  |-  ( (
ph  /\  Q  <  T )  ->  ( ( Q  +  1 )  x.  D )  <_ 
( T  x.  D
) )
4131, 40eqbrtrrd 4110 . . . . . . . 8  |-  ( (
ph  /\  Q  <  T )  ->  ( ( Q  x.  D )  +  D )  <_  ( T  x.  D )
)
4226, 30, 11, 41leadd1dd 8729 . . . . . . 7  |-  ( (
ph  /\  Q  <  T )  ->  ( (
( Q  x.  D
)  +  D )  +  S )  <_ 
( ( T  x.  D )  +  S
) )
43 divalglemnqt.eq . . . . . . . 8  |-  ( ph  ->  ( ( Q  x.  D )  +  R
)  =  ( ( T  x.  D )  +  S ) )
4443adantr 276 . . . . . . 7  |-  ( (
ph  /\  Q  <  T )  ->  ( ( Q  x.  D )  +  R )  =  ( ( T  x.  D
)  +  S ) )
4542, 44breqtrrd 4114 . . . . . 6  |-  ( (
ph  /\  Q  <  T )  ->  ( (
( Q  x.  D
)  +  D )  +  S )  <_ 
( ( Q  x.  D )  +  R
) )
4624, 45eqbrtrrd 4110 . . . . 5  |-  ( (
ph  /\  Q  <  T )  ->  ( ( Q  x.  D )  +  ( D  +  S ) )  <_ 
( ( Q  x.  D )  +  R
) )
4712, 8, 25leadd2d 8710 . . . . 5  |-  ( (
ph  /\  Q  <  T )  ->  ( ( D  +  S )  <_  R  <->  ( ( Q  x.  D )  +  ( D  +  S
) )  <_  (
( Q  x.  D
)  +  R ) ) )
4846, 47mpbird 167 . . . 4  |-  ( (
ph  /\  Q  <  T )  ->  ( D  +  S )  <_  R
)
495, 12, 8, 16, 48letrd 8293 . . 3  |-  ( (
ph  /\  Q  <  T )  ->  D  <_  R )
505, 8, 49lensymd 8291 . 2  |-  ( (
ph  /\  Q  <  T )  ->  -.  R  <  D )
512, 50pm2.65da 665 1  |-  ( ph  ->  -.  Q  <  T
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   class class class wbr 4086  (class class class)co 6013   RRcr 8021   0cc0 8022   1c1 8023    + caddc 8025    x. cmul 8027    < clt 8204    <_ cle 8205   NNcn 9133   ZZcz 9469
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-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140
This theorem depends on definitions:  df-bi 117  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-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-inn 9134  df-n0 9393  df-z 9470
This theorem is referenced by:  divalglemeunn  12472  divalglemeuneg  12474
  Copyright terms: Public domain W3C validator