[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-eq-append
y ≠ [] ⊦ prefixn(n, x) = prefixn(n, x + y) ↔ n ≤ # x
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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:
prefixn
,
Used spec theorems:
Used simplifier rules:
list-del
/
first-append
nat-basic2
/
l-02
nat-basic1
/
f
nat
/
fle
list
/
app-04
list
/
app-01
list
/
a
list-data
/
l
list
/
len
nat
/
lep
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
ref-1
nat
/
lels-01
nat
/
le-ls-simp
list-del
/
elim-firstn-restn