[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 resetcnt-mod-cnt
⊦ n < # P ∧ P[n] = pe(m, m0, m1) → resetcnt(P[n, pe(m, m0, m2)]) = resetcnt(P)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
REFINEONE-theorem
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 12
Used lemmas:
resetcnt-empty
,
resetcnt-rec
,
Used spec theorems:
list-del
/partition/
get-append-less
Used simplifier rules:
nat
/
lels
nat-basic2
/
s
list
/partition/
len
list
/partition/
e-01
nat-basic1
/
zero-01
nat
/
lez-01
list-data
/partition/
size-01
list
/partition/
app
list-del
/partition/
put-app-left
list-del
/partition/
one-03
list-del
/partition/
put-one
partelem
/
upd-03
list
/partition/
app-03
list
/partition/
c-04
nat
/
lez
nat-basic1
/
one-01
list
/partition/
len-02
list-del
/partition/
get-append-grt
nat
/
elim-pred-c
list-data
/partition/
l
nat-basic1
/
f
nat
/
succ-01
nat-basic2
/
oz
list
/partition/
app-01
list
/partition/
a
nat-basic2
/
c
nat-basic2
/
a
list
/partition/
c
list-del
/partition/
put-succ