[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 addle-01
⊦ m * n1 = m * m0 + n0 ∧ m ≠ 0 → ¬ n1 < m0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
addle
,
Used by units in proved state:
nat-prime
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 4
Used lemmas:
rsucc-02
,
mult-c
,
mult-a
,
mult-base
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
f
nat-basic2
/
add-base
nat-basic1
/
zero-01
nat-basic2
/
s
nat-basic2
/
succ
nat-basic2
/
a
nat-basic2
/
c
nat
/
lels
nat
/
anti
nat-basic2
/
eq
nat-basic2
/
z-01