[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 mult-le-01
⊦ m ≤ n → (n * n ≤ m + 1 ↔ n ≤ 1 ∧ m ≤ 1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
sqp
,
sqr-09
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 7
Used lemmas:
sqls
,
sqr-08
,
one-01
,
sqzero
,
sqle-02
,
mult-c
,
mult-a
,
le-succ
,
Used spec theorems:
nat
/
le-def
Used simplifier rules:
nat
/
lez
nat
/
fle-01
nat-basic1
/
f
nat
/
fle
nat
/
not-zero
nat
/
let
nat
/
le-ls-simp
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
one
nat
/
one-02
nat
/
anti
nat
/
lez-01
nat-basic1
/
twols-02
nat
/
lels-01