[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-to-adrs
⊦ prefixn(n, lax.to-adr(m)) = prefixn(n, lax).to-adr(m)
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: 4
Proof steps: 10
Used lemmas:
to-adrs-eq
,
to-adrs-append
,
addresslist-length
,
Used spec theorems:
list-prefixn
/address-list-set/
prefixn
list-prefixn
/laddress-list/
prefixn
list-del
/address-list-set/
first-append
list-del
/address-list-set/
first-all-01
Used simplifier rules:
list-del
/laddress-list/
elim-firstn-restn
nat-basic
/
c
nat-basic
/
a
nat
/
lep
list
/laddress-list/
len
list
/laddress-list/
a
nat
/
le-def
oelem
/nat-set/
irreflexivity
nat
/
ler