[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 pushx-ordered
⊦ ordered(ixs, x) ∧ inv(ixs, n) ∧ n < # x → (¬ ordered(pushx(n, ixs, x), x) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
solixh-ordered
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 12
Used lemmas:
ordered-rec2
,
allls-rec
,
pushx-rec
,
orderedl-rec
,
inv-rec
,
ordered-rec1
,
ordered-single
,
pushx-base
,
orderedl-base
,
inv-base
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
list
/indexseq/
app
list
/indexseq-stackseq/
app
list
/indexseq-stackseq/
c
list
/indexseq-stackseq/
a
list-data
/indexseq/
elim-list-c
nat-basic2
/
succ
oelem
/indexseq/
transitivity
nat-basic1
/
f
nat-basic1
/
lf
list
/indexseq/
a
list
/indexseq/
e-01
list
/indexseq/
c
nat
/
ax-02
nat
/
lels
nat
/
ls-le-simp