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

Theorem nn0opthlem2d 10938
Description: Lemma for nn0opth2 10941. (Contributed by Jim Kingdon, 31-Oct-2021.)
Hypotheses
Ref Expression
nn0opthd.1  |-  ( ph  ->  A  e.  NN0 )
nn0opthd.2  |-  ( ph  ->  B  e.  NN0 )
nn0opthd.3  |-  ( ph  ->  C  e.  NN0 )
nn0opthd.4  |-  ( ph  ->  D  e.  NN0 )
Assertion
Ref Expression
nn0opthlem2d  |-  ( ph  ->  ( ( A  +  B )  <  C  ->  ( ( C  x.  C )  +  D
)  =/=  ( ( ( A  +  B
)  x.  ( A  +  B ) )  +  B ) ) )

Proof of Theorem nn0opthlem2d
StepHypRef Expression
1 nn0opthd.1 . . . . . . . 8  |-  ( ph  ->  A  e.  NN0 )
2 nn0opthd.2 . . . . . . . 8  |-  ( ph  ->  B  e.  NN0 )
31, 2nn0addcld 9422 . . . . . . 7  |-  ( ph  ->  ( A  +  B
)  e.  NN0 )
43nn0red 9419 . . . . . 6  |-  ( ph  ->  ( A  +  B
)  e.  RR )
54, 4remulcld 8173 . . . . 5  |-  ( ph  ->  ( ( A  +  B )  x.  ( A  +  B )
)  e.  RR )
62nn0red 9419 . . . . 5  |-  ( ph  ->  B  e.  RR )
75, 6readdcld 8172 . . . 4  |-  ( ph  ->  ( ( ( A  +  B )  x.  ( A  +  B
) )  +  B
)  e.  RR )
87adantr 276 . . 3  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  e.  RR )
9 nn0opthd.3 . . . . . . 7  |-  ( ph  ->  C  e.  NN0 )
109nn0red 9419 . . . . . 6  |-  ( ph  ->  C  e.  RR )
1110, 10remulcld 8173 . . . . 5  |-  ( ph  ->  ( C  x.  C
)  e.  RR )
1211adantr 276 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( C  x.  C )  e.  RR )
13 nn0opthd.4 . . . . . . 7  |-  ( ph  ->  D  e.  NN0 )
1413nn0red 9419 . . . . . 6  |-  ( ph  ->  D  e.  RR )
1511, 14readdcld 8172 . . . . 5  |-  ( ph  ->  ( ( C  x.  C )  +  D
)  e.  RR )
1615adantr 276 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( ( C  x.  C )  +  D )  e.  RR )
17 2re 9176 . . . . . . . . 9  |-  2  e.  RR
1817a1i 9 . . . . . . . 8  |-  ( ph  ->  2  e.  RR )
1918, 4remulcld 8173 . . . . . . 7  |-  ( ph  ->  ( 2  x.  ( A  +  B )
)  e.  RR )
205, 19readdcld 8172 . . . . . 6  |-  ( ph  ->  ( ( ( A  +  B )  x.  ( A  +  B
) )  +  ( 2  x.  ( A  +  B ) ) )  e.  RR )
2120adantr 276 . . . . 5  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  ( 2  x.  ( A  +  B
) ) )  e.  RR )
22 nn0addge2 9412 . . . . . . . . 9  |-  ( ( B  e.  RR  /\  A  e.  NN0 )  ->  B  <_  ( A  +  B ) )
236, 1, 22syl2anc 411 . . . . . . . 8  |-  ( ph  ->  B  <_  ( A  +  B ) )
24 nn0addge1 9411 . . . . . . . . . 10  |-  ( ( ( A  +  B
)  e.  RR  /\  ( A  +  B
)  e.  NN0 )  ->  ( A  +  B
)  <_  ( ( A  +  B )  +  ( A  +  B ) ) )
254, 3, 24syl2anc 411 . . . . . . . . 9  |-  ( ph  ->  ( A  +  B
)  <_  ( ( A  +  B )  +  ( A  +  B ) ) )
264recnd 8171 . . . . . . . . . 10  |-  ( ph  ->  ( A  +  B
)  e.  CC )
27262timesd 9350 . . . . . . . . 9  |-  ( ph  ->  ( 2  x.  ( A  +  B )
)  =  ( ( A  +  B )  +  ( A  +  B ) ) )
2825, 27breqtrrd 4110 . . . . . . . 8  |-  ( ph  ->  ( A  +  B
)  <_  ( 2  x.  ( A  +  B ) ) )
296, 4, 19, 23, 28letrd 8266 . . . . . . 7  |-  ( ph  ->  B  <_  ( 2  x.  ( A  +  B ) ) )
306, 19, 5, 29leadd2dd 8703 . . . . . 6  |-  ( ph  ->  ( ( ( A  +  B )  x.  ( A  +  B
) )  +  B
)  <_  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  ( 2  x.  ( A  +  B
) ) ) )
3130adantr 276 . . . . 5  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  <_ 
( ( ( A  +  B )  x.  ( A  +  B
) )  +  ( 2  x.  ( A  +  B ) ) ) )
323, 9nn0opthlem1d 10937 . . . . . 6  |-  ( ph  ->  ( ( A  +  B )  <  C  <->  ( ( ( A  +  B )  x.  ( A  +  B )
)  +  ( 2  x.  ( A  +  B ) ) )  <  ( C  x.  C ) ) )
3332biimpa 296 . . . . 5  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  ( 2  x.  ( A  +  B
) ) )  < 
( C  x.  C
) )
348, 21, 12, 31, 33lelttrd 8267 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  < 
( C  x.  C
) )
35 nn0addge1 9411 . . . . . 6  |-  ( ( ( C  x.  C
)  e.  RR  /\  D  e.  NN0 )  -> 
( C  x.  C
)  <_  ( ( C  x.  C )  +  D ) )
3611, 13, 35syl2anc 411 . . . . 5  |-  ( ph  ->  ( C  x.  C
)  <_  ( ( C  x.  C )  +  D ) )
3736adantr 276 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( C  x.  C )  <_  (
( C  x.  C
)  +  D ) )
388, 12, 16, 34, 37ltletrd 8566 . . 3  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  < 
( ( C  x.  C )  +  D
) )
398, 38gtned 8255 . 2  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( ( C  x.  C )  +  D )  =/=  (
( ( A  +  B )  x.  ( A  +  B )
)  +  B ) )
4039ex 115 1  |-  ( ph  ->  ( ( A  +  B )  <  C  ->  ( ( C  x.  C )  +  D
)  =/=  ( ( ( A  +  B
)  x.  ( A  +  B ) )  +  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2200    =/= wne 2400   class class class wbr 4082  (class class class)co 6000   RRcr 7994    + caddc 7998    x. cmul 8000    < clt 8177    <_ cle 8178   2c2 9157   NN0cn0 9365
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-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113
This theorem depends on definitions:  df-bi 117  df-dc 840  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-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-2 9165  df-n0 9366  df-z 9443  df-uz 9719  df-seqfrec 10665  df-exp 10756
This theorem is referenced by:  nn0opthd  10939
  Copyright terms: Public domain W3C validator