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

Theorem nn0opthlem2d 10655
Description: Lemma for nn0opth2 10658. (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 9192 . . . . . . 7  |-  ( ph  ->  ( A  +  B
)  e.  NN0 )
43nn0red 9189 . . . . . 6  |-  ( ph  ->  ( A  +  B
)  e.  RR )
54, 4remulcld 7950 . . . . 5  |-  ( ph  ->  ( ( A  +  B )  x.  ( A  +  B )
)  e.  RR )
62nn0red 9189 . . . . 5  |-  ( ph  ->  B  e.  RR )
75, 6readdcld 7949 . . . 4  |-  ( ph  ->  ( ( ( A  +  B )  x.  ( A  +  B
) )  +  B
)  e.  RR )
87adantr 274 . . 3  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  e.  RR )
9 nn0opthd.3 . . . . . . 7  |-  ( ph  ->  C  e.  NN0 )
109nn0red 9189 . . . . . 6  |-  ( ph  ->  C  e.  RR )
1110, 10remulcld 7950 . . . . 5  |-  ( ph  ->  ( C  x.  C
)  e.  RR )
1211adantr 274 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( C  x.  C )  e.  RR )
13 nn0opthd.4 . . . . . . 7  |-  ( ph  ->  D  e.  NN0 )
1413nn0red 9189 . . . . . 6  |-  ( ph  ->  D  e.  RR )
1511, 14readdcld 7949 . . . . 5  |-  ( ph  ->  ( ( C  x.  C )  +  D
)  e.  RR )
1615adantr 274 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( ( C  x.  C )  +  D )  e.  RR )
17 2re 8948 . . . . . . . . 9  |-  2  e.  RR
1817a1i 9 . . . . . . . 8  |-  ( ph  ->  2  e.  RR )
1918, 4remulcld 7950 . . . . . . 7  |-  ( ph  ->  ( 2  x.  ( A  +  B )
)  e.  RR )
205, 19readdcld 7949 . . . . . 6  |-  ( ph  ->  ( ( ( A  +  B )  x.  ( A  +  B
) )  +  ( 2  x.  ( A  +  B ) ) )  e.  RR )
2120adantr 274 . . . . 5  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  ( 2  x.  ( A  +  B
) ) )  e.  RR )
22 nn0addge2 9182 . . . . . . . . 9  |-  ( ( B  e.  RR  /\  A  e.  NN0 )  ->  B  <_  ( A  +  B ) )
236, 1, 22syl2anc 409 . . . . . . . 8  |-  ( ph  ->  B  <_  ( A  +  B ) )
24 nn0addge1 9181 . . . . . . . . . 10  |-  ( ( ( A  +  B
)  e.  RR  /\  ( A  +  B
)  e.  NN0 )  ->  ( A  +  B
)  <_  ( ( A  +  B )  +  ( A  +  B ) ) )
254, 3, 24syl2anc 409 . . . . . . . . 9  |-  ( ph  ->  ( A  +  B
)  <_  ( ( A  +  B )  +  ( A  +  B ) ) )
264recnd 7948 . . . . . . . . . 10  |-  ( ph  ->  ( A  +  B
)  e.  CC )
27262timesd 9120 . . . . . . . . 9  |-  ( ph  ->  ( 2  x.  ( A  +  B )
)  =  ( ( A  +  B )  +  ( A  +  B ) ) )
2825, 27breqtrrd 4017 . . . . . . . 8  |-  ( ph  ->  ( A  +  B
)  <_  ( 2  x.  ( A  +  B ) ) )
296, 4, 19, 23, 28letrd 8043 . . . . . . 7  |-  ( ph  ->  B  <_  ( 2  x.  ( A  +  B ) ) )
306, 19, 5, 29leadd2dd 8479 . . . . . 6  |-  ( ph  ->  ( ( ( A  +  B )  x.  ( A  +  B
) )  +  B
)  <_  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  ( 2  x.  ( A  +  B
) ) ) )
3130adantr 274 . . . . 5  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  <_ 
( ( ( A  +  B )  x.  ( A  +  B
) )  +  ( 2  x.  ( A  +  B ) ) ) )
323, 9nn0opthlem1d 10654 . . . . . 6  |-  ( ph  ->  ( ( A  +  B )  <  C  <->  ( ( ( A  +  B )  x.  ( A  +  B )
)  +  ( 2  x.  ( A  +  B ) ) )  <  ( C  x.  C ) ) )
3332biimpa 294 . . . . 5  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  ( 2  x.  ( A  +  B
) ) )  < 
( C  x.  C
) )
348, 21, 12, 31, 33lelttrd 8044 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  < 
( C  x.  C
) )
35 nn0addge1 9181 . . . . . 6  |-  ( ( ( C  x.  C
)  e.  RR  /\  D  e.  NN0 )  -> 
( C  x.  C
)  <_  ( ( C  x.  C )  +  D ) )
3611, 13, 35syl2anc 409 . . . . 5  |-  ( ph  ->  ( C  x.  C
)  <_  ( ( C  x.  C )  +  D ) )
3736adantr 274 . . . 4  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( C  x.  C )  <_  (
( C  x.  C
)  +  D ) )
388, 12, 16, 34, 37ltletrd 8342 . . 3  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( (
( A  +  B
)  x.  ( A  +  B ) )  +  B )  < 
( ( C  x.  C )  +  D
) )
398, 38gtned 8032 . 2  |-  ( (
ph  /\  ( A  +  B )  <  C
)  ->  ( ( C  x.  C )  +  D )  =/=  (
( ( A  +  B )  x.  ( A  +  B )
)  +  B ) )
4039ex 114 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 103    e. wcel 2141    =/= wne 2340   class class class wbr 3989  (class class class)co 5853   RRcr 7773    + caddc 7777    x. cmul 7779    < clt 7954    <_ cle 7955   2c2 8929   NN0cn0 9135
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-n0 9136  df-z 9213  df-uz 9488  df-seqfrec 10402  df-exp 10476
This theorem is referenced by:  nn0opthd  10656
  Copyright terms: Public domain W3C validator