[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 leq-modsucc
n ≠ 0 ⊦ n ≤ n0 + m ∧ m < n → (n = n0 + (m + 1) % n ↔ n = m +1 ∧ n = n0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
mod-zero
,
mod-eq
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat-basic
/
oz
nat-basic
/
lf-01
nat
/
eqle-one
nat
/
eq
nat-basic
/
f
nat-basic
/
succ-03
nat-basic
/
l-01
nat
/
fle
nat-basic
/
eq-01
nat-basic
/
succ