[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 le-succ
⊦ m * n ≤ m + 1 ↔ m = 0 ∨ m = 1 ∧ n ≤ 2 ∨ 2 ≤ m ∧ n < 2
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
mult-le-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
zero-01
,
mult-c
,
mult-a
,
one
,
modp
,
Used spec theorems:
Used simplifier rules:
nat
/
lels
nat
/
not-zero
nat
/
let
nat
/
lels-03
nat-basic1
/
one
nat-basic1
/
ls-02
nat
/
ls-le-simp
nat-basic1
/
twols-02
nat-basic1
/
f
nat
/
lels-01
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
nat
/
le-ls-simp