[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 ascsubseq-in-size
⊦ n ∈ ix ∧ ascsubseq(ix, x) → (# x ≤ n ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
covers-ascsubseq
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
precedes-def
,
ascsubseq-rec
,
ascsubseq-single
,
Used spec theorems:
Used simplifier rules:
list
/indexseq/
app
list
/indexseq/
in-empty
nat-basic1
/
lf-02
oelem
/indexseq/
irreflexivity
list
/indexseq/
in-17
list
/indexseq/
in-append
list
/indexseq/
a
list
/indexseq/
c
nat
/
fle-01
nat
/
fle
nat-basic1
/
lf
oelem
/indexseq/
transitivity
list-data
/
l
nat-basic1
/
f
nat-basic1
/
ls-02