[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem square-ls-03
⊦ m0 ≤ m ∧ m ≤ n → (m * (m + 1)) / 2 + m0 < ((n + 1) * (n + 2)) / 2
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
nat-pair
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 10
Used lemmas:
square-even-02
,
mod-mult-01
,
square-even-03
,
mod-once
,
mod-add
,
ls-even
,
ls-02
,
mult
,
two-rec
,
square-ls
,
Used spec theorems:
nat
/
lels
nat-mult
/
dist
Used simplifier rules:
nat-basic2
/
eq-01
nat-basic1
/
trans
nat-basic1
/
trans-1
nat
/
let
nat-basic2
/
s
nat
/
lels
nat-basic2
/
l
nat-mult
/
rsucc-02
nat-mult
/
succ
nat-basic2
/
a
nat-basic2
/
c
nat-mult
/
mult-a
nat
/
lep-02
nat-mult
/
coef-18
nat
/
succ-01
nat
/
fle-01
nat
/
fle
nat-basic1
/
f
nat-basic1
/
ref-1
nat-mult
/
mult-c