[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-covers
⊦ covers(ixs, n) ∧ n < # x → (¬ covers(pushx(n, ixs, x), n + 1) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
solixh-covers
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 31
Used lemmas:
covers-def
,
pushx-nonrec
,
Used spec theorems:
list-del
/indexseq-stackseq/
put-at
Used simplifier rules:
list-data
/
l
list
/indexseq/
c
list
/indexseq-stackseq/
in-15
list
/indexseq-stackseq/
in-17
list
/indexseq-stackseq/
in-append
list
/indexseq-stackseq/
len-02
list
/indexseq-stackseq/
len
nat
/
ler
nat
/
anti
oelem
/indexseq/
irreflexivity
list-del
/indexseq-stackseq/
get-last-03
list-data
/indexseq-stackseq/
l
nat-basic1
/
f
nat-basic1
/
ls-02
list-del
/indexseq-stackseq/
get-append-less
list
/indexseq-stackseq/
a
nat
/
fle-01
list-del
/indexseq-stackseq/
put-length
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
list
/indexseq/
in-append
list
/indexseq/
in-17
nat
/
lels
nat
/
ls-le-simp
nat-basic1
/
lf-02
list-del
/indexseq-stackseq/
put-at-eq
list
/indexseq/
in-06
list
/indexseq/
a