[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 in-prefixn-in-shorter-prefix
⊦ a ∈ prefixn(n0, x) ∧ n0 ≤ n1 → a ∈ prefixn(n1, x)
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 9
Used lemmas:
prefixn
,
Used spec theorems:
list-del
/
firstn-app-01
Used simplifier rules:
list-del
/
firstN-in-04
list-del
/
elim-firstn-restn
nat
/
let
nat-basic
/
c
nat-basic
/
a
nat
/
lep
list
/
len
list
/
in-11
list
/
a
nat-basic
/
f
nat
/
le-def
list-del
/
firstN-in