[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 precedesex-rev-rec1
⊦ precedes∃(ixs + ix0 ' + ix1 ', x) ↔ precedes∃(ixs + ix0, x) ∧ (∀ n1. n1 ∈ ix1 → (∃ n0. n0 ∈ ix0 ∧ precedes(n0, n1, x)))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
theoremx-atleast-ind
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 22
Used lemmas:
precedesex-rec1
,
precedesex-prepend
,
precedesex-rec0
,
precedesex-2
,
Used spec theorems:
Used simplifier rules:
list
/indexseq-stackseq/
Last
list
/indexseq-stackseq/
Nil
list
/indexseq-stackseq/
c
list
/indexseq-stackseq/
a