[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
,
Proof step 11 from proof newrefs-lastn (conclusion)
⊦ is_newref_list(refs, st) ∧ n ≤ # refs → is_newref_list(lastn(n, refs), st)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
n ≤ # refs, is_newref_list(refs, st) ⊦ is_newref_list(lastn(n, refs), st)
Rule argument
[emptyarg]
Additional information
[[CONCRETESIMPRULES : ()]]