[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-nodups
⊦ n ∈ ix0 ∧ ascsubseq(ix0 + ix1, x) → (n ∈ ix1 ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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: 6
Proof steps: 11
Used lemmas:
precedes-trans
,
ascsubseq-rest-notprec-first
,
ascsubseq-rec
,
ascsubseq-first-notin-rest
,
Used spec theorems:
Used simplifier rules:
list
/indexseq/
Nil
list
/indexseq/
in-empty
list
/indexseq/
in-17
list
/indexseq/
in-append
list
/indexseq/
c
list
/indexseq/
a
list
/indexseq/
in-12