[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 firstn-prefix-04
⊦ # x = (1 + # z) + n0 → (¬ firstn(1 + n0, x) ⊑ x ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
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: 4
Used lemmas:
firstn-prefix
,
firstN-rec
,
Used spec theorems:
Used simplifier rules:
list-data
/
size-01
nat-basic2
/
z-01
list-data
/
elim-list-c
list-last
/
prefix-rec-02
list
/
e-01
nat-basic2
/
eq-01
list
/
a
nat-basic2
/
succ
list
/
len-05
list
/
c
nat
/
lels-01
nat-basic1
/
f
nat-basic1
/
lf-02
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c