[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 prefixn-size-prefixn
⊦ prefixn(# prefixn(n, x), x) = prefixn(n, x)
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: 0
Proof steps: 6
Used lemmas:
prefixn
,
Used spec theorems:
Used simplifier rules:
nat
/
ler
list-del
/
first-all
list-del
/
first-length
nat-basic
/
f
nat
/
le-def
nat-basic
/
ref
list-del
/
firstn-length-04
nat
/
le-ls-simp