[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 pushx-nonrec
⊦ n < # x ∧ ixs = pushx(n, ixs0, x) → ixs = ixs0 + n ' ' ∨ (∃ m. m < # ixs0 ∧ ixs = ixs0[m, n + ixs0[m]])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
pushx-covers
,
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:
pushx-rec
,
pushx-base
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
list
/indexseq/
app
list
/indexseq/
a
list
/indexseq-stackseq/
app
list
/indexseq-stackseq/
Nil
list
/indexseq-stackseq/
c-04
list
/indexseq-stackseq/
len-02
list
/indexseq-stackseq/
len
list
/indexseq/
c
list-data
/indexseq-stackseq/
l
nat-basic1
/
f
nat-basic2
/
s
nat-basic2
/
a
nat-basic2
/
c
list-del
/indexseq-stackseq/
get-succ
list-del
/indexseq-stackseq/
put-succ
nat-basic1
/
zero-01
list-del
/indexseq-stackseq/
get-zero-01
list
/indexseq-stackseq/
a
list-del
/indexseq-stackseq/
put-zero
list
/indexseq-stackseq/
c
list
/indexseq-stackseq/
app-01