[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 covers-rem
⊦ covers(ix ' + ixs, ix0 + n ' + ix1) ∧ ¬ covers(ixs, ix0 + ix1) → (∃ n. n ∈ ix ∧ (n ∈ ix0 ∨ n ∈ ix1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
theoremx-atmost-h
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 26
Used lemmas:
coversi-def
,
Used spec theorems:
list-del
/indexseq-stackseq/
get-rec
Used simplifier rules:
nat-basic2
/
s
list
/indexseq-stackseq/
len-02
list
/indexseq-stackseq/
len
list
/indexseq/
in-17
list
/indexseq/
a
list
/indexseq/
in-append
nat
/
lels
list-del
/indexseq-stackseq/
get-zero-01
nat
/
lez
list
/indexseq-stackseq/
c-07
list
/indexseq-stackseq/
a
list
/indexseq-stackseq/
e-01
nat
/
elim-pred-c
list-data
/indexseq-stackseq/
l
nat-basic1
/
f
nat
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz