[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 pushix-to-push
⊦ inv(ixs, # x0) → push(a, ixs.tolist(x0)) = pushx(# x0, ixs, x0 + a).tolist(x0 + a)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
solixh-to-solitaireh
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 12
Used lemmas:
tolistl-cut-seq
,
tolist-cut-seq
,
allls-rec
,
tolist-rec
,
push-rec
,
pushx-rec
,
inv-rec
,
tolistl-rec
,
tolist-single
,
tolistl-single
,
pushx-base
,
push-base
,
tolistl-base
,
Used spec theorems:
Used simplifier rules:
list
/
Last
list
/
app
list
/stackseq/
app
list
/indexseq/
app
list
/indexseq-stackseq/
app
list
/stackseq/
c-04
list
/indexseq-stackseq/
c
list-data
/indexseq/
elim-list-c
list-data
/
l
nat-basic1
/
f
list
/
c-08
list
/indexseq/
e-01
list
/indexseq/
c
list-del
/
get-last-03
list
/stackseq/
a
list
/stackseq/
app-01
list
/indexseq-stackseq/
a
list
/stackseq/
c
list
/indexseq/
a
list
/
c
list-del
/
get-append-less
list
/
a