[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 keys-firstn
⊦ n ≤ # ax → firstn(n, keys(fs, ax)) = keys(fs, firstn(n, ax))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 7
Used lemmas:
keys-rec
,
keys-base
,
keys-append
,
Used spec theorems:
Used simplifier rules:
list-del
/address-list-set/
elim-firstn-restn
nat
/
lep
list
/address-list-set/
len
list-data
/address-list-set/
size-01
list
/key-list-set/
Nil
list-del
/key-list-set/
firstN-zero
list
/key-list-set/
app-08
nat-basic
/
c
nat-basic
/
a
list-del
/key-list-set/
weak-firstN-rec
list
/key-list-set/
a
list
/key-list-set/
c
list
/address-list-set/
a
nat-basic
/
succ
list
/address-list-set/
len-05
list
/address-list-set/
c