[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 allslotsfull-incfalse
n < # ar, n0 < # ar ⊦ ar[n] ≠ ⊥ ∧ ar[n] ≠ e → (allslotsfull(ar, n0, (n + 1) % # ar, e, false) ↔ allslotsfull(ar, n0, n, e, false) ∨ (n + 1) % # ar = n0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 16
Used lemmas:
between-def
,
allslotsfull-def
,
Used spec theorems:
nat-div
/
rax
Used simplifier rules:
nat-basic
/
f
nat-basic
/
neq-01
nat-basic
/
refl-Nat
nat-div
/
mod-eq
nat-basic
/
s-04
nat
/
lels
nat
/
fle
nat-div
/
modsucc-less
nat-basic
/
oz
nat-div
/
mod-ls
nat-basic
/
succ
nat-basic
/
l-06
nat
/
lels-03
nat
/
eqle-one
nat-basic
/
a
nat-basic
/
c
nat-basic
/
lf-01
nat
/
fle-01
nat-basic
/
lf
nat-basic
/
trans-Nat
nat-div
/
mod-zero
nat
/
le-def
nat
/
ls-le-simp
nat-basic
/
l-02
nat
/
anti
nat
/
ler
nat
/
les
nat-basic
/
one
nat-basic
/
zero
nat-basic
/
less-zero
nat
/
let
nat-basic
/
lf-02
nat-basic
/
one-04
nat
/
le-ls-simp
nat-div
/
cond
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
l
nat-basic
/
one-01
nat
/
lez
nat
/
ls
nat-basic
/
add-base