[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-rec
⊦ ascsubseq(n ' + m ' + ix, x) ↔ precedes(n, m, x) ∧ ascsubseq(m + ix, x)
Type: An axiom
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
ascsubseq-2
,
ascsubseq-append
,
ascsubseq-empty
,
ascsubseq-first-notin-rest
,
ascsubseq-in-size
,
ascsubseq-nodups
,
ascsubseq-prepend
,
ascsubseq-rem
,
ascsubseq-rest-notprec-first
,
precedes-ascsubseq-2-h
,
Used by units in proved state:
Proof exists?: No