[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 last-notin-butlast-nodups
⊦ nx ≠ [] ∧ ¬ dups(nx) → ¬ nx.last ∈ nx.butlast
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
Used spec theorems:
list
/nat-list-set/
lastdiv-rew
Used simplifier rules:
list-last
/nat-list-set/
lin-01
list-last
/nat-list-set/
bin-01
list-last
/nat-list-set/
last-def
list
/nat-list-set/
a
list-last
/nat-list-set/
butlast-def
list-dup
/nat-list-set/
l