[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-le-one
⊦ 0 < i → (sqrt(i) ≤ 1 ↔ i < 4)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
square-le-one-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 15
Used lemmas:
Square-def
,
square-not-neg
,
two-ls-pospos
,
Sqrt-def
,
one-01
,
square-two
,
square-three
,
Used spec theorems:
int-basic1
/
ls-rec
Used simplifier rules:
int-abs
/
numlelsdel
int-basic1
/
two-ls
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-basic2
/
succ-01
int-abs
/
zero-gels-04
int-abs
/
numle-02
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
numls-02
int-abs
/
lenls
int-abs
/
lels-01
int-basic1
/
numlsf
int-abs
/
forward-lels