[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-prefixn-app
⊦ prefixn(n0, x0) = prefixn(n1, x0 + x1) ↔ n0 < # x0 ∧ n0 = n1 ∨ n0 ≥ # x0 ∧ n1 ≥ # x0 ∧ x1 = [] ∨ n0 ≥ # x0 ∧ n1 = # x0 ∧ x1 ≠ []
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: 5
Proof steps: 22
Used lemmas:
prefixn
,
Used spec theorems:
Used simplifier rules:
nat
/
ge
list-del
/
first-all
list
/
app-02
nat
/
le-add
list-del
/
first-length
nat
/
lels
nat
/
lels-02
nat
/
ls-le-simp
nat-basic
/
lf
nat-basic
/
trans
nat-basic
/
succ
list
/
app-01
nat
/
ler
nat-basic
/
l-01
nat
/
lep
list-del
/
firstN-len
list-del
/
first-all-01
list
/
Nil
nat-basic
/
l-02
nat
/
lels-03
nat-basic
/
ls-02
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
l-05
nat
/
le-def
nat
/
le-ls-simp
list-del
/
elim-firstn-restn
list
/
len-01
list
/
a
list
/
app
list-data
/
size-01
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat
/
anti
nat
/
fle-01
nat-basic
/
lf-02
list
/
len
nat-basic
/
eq-02
list-data
/
l
list
/
app-04