[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-full-eq
⊦ prefixn(n, x) = x ↔ n ≥ # x
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
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: 2
Used lemmas:
prefixn
,
Used spec theorems:
list-data
/
length-neq
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat
/
lels-03
nat
/
le-def
list-del
/
first-all
nat
/
anti
nat
/
ge
list-del
/
firstn-length-03
list-del
/
first-all-01
nat-basic
/
lf-02
nat-basic
/
lf-01
nat-basic
/
ls-02