[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-04
⊦ m0 ≤ 2 * m → (m * m + m0 < n * n ↔ m < n)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 10
Used lemmas:
zero-06
,
two-02
,
rsucc-01
,
square-less
,
square-le-02
,
mult-c
,
mult-a
,
sqzero
,
Used spec theorems:
nat
/
fle
Used simplifier rules:
nat
/
lels
nat
/
lels-01
nat-basic2
/
l-02
nat-basic2
/
l
nat
/
le-ls-simp
nat-basic1
/
f
nat
/
fle
nat-basic2
/
s
nat-basic2
/
a
nat-basic2
/
c