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