[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 extension
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
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: 4
Proof steps: 10
Used lemmas:
get-zero
,
get-succ
,
Used spec theorems:
Used simplifier rules:
list-data
/
size-nil
list-data
/
l
list
/
c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
nat-basic
/
z-01
list-data
/
elim-list-c
list
/
e-01
nat-basic
/
eq-01
nat-basic
/
f
list
/
c-06
nat-basic
/
less-zero