[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 resetcount-elem
⊦ resetcnt(P)[n] = pe(m, m0, m1) → (∃ m2. P[n] = pe(m, m0, m2))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Fok-lem
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 16
Used lemmas:
resetcnt-rec
,
resetcnt-empty
,
Used spec theorems:
list-del
/partition/
get-append-grt
Used simplifier rules:
list
/partition/
c
list-del
/partition/
get-zero-01
list-del
/partition/
one-03
list-del
/partition/
get-append-less
partelem
/
inj
partelem
/
upd-03
nat-basic1
/
one-01
list
/partition/
len-02
nat
/
elim-pred-c
list
/partition/
a
list-del
/partition/
get-succ
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz