[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 newrefs-last-01
⊦ ¬ newref_list(n + 1, st) .last ∈ newref_list(n, st)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
newrefs-butlast
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
newref-02
,
newrefs-new
,
instore-02
,
newref-new
,
newrefs-empty
,
newrefs-rec-01
,
newrefs-succ
,
newrefs-zero
,
newrefs-one-01
,
Used spec theorems:
list-last
/references/
l-02
Used simplifier rules:
list-last
/references/
lin-01
list
/references/
app
list-last
/references/
l-05
nat
/
add-01
nat
/
pred-03
nat
/
add-num-03
nat-basic1
/
z
nat-basic2
/
z-01
list
/references/
a
list
/references/
in-17
list
/references/
in-append
nat-basic2
/
c
nat-basic2
/
a
list
/references/
c
nat-basic2
/
succ
list-last
/references/
l
list
/references/
in-empty