[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 ladrlist-to-adr-split
n < # lax ⊦ lax.to-adr(m)[n] = adr ↔ (∃ lax0, lax1. lax = lax0 + @(adr.pos, adr.size) ' + lax1 ∧ adr.lnum = m ∧ # lax0 = n)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
nodes-cons-write-app
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 21
Used lemmas:
Used spec theorems:
list-del
/address-list-set/
get-append-grt
Used simplifier rules:
address-data
/
elim
nat
/
lels
list
/laddress-list/
e-01
laddress
/
elim
list-del
/address-list-set/
get-append-less
list-del
/address-list-set/
one-03
nat
/
lez
list
/laddress-list/
app-08
nat-basic
/
one-01
list
/address-list-set/
len-02
nat
/
elim-pred-c
list-data
/laddress-list/
l
nat-basic
/
lf-02
nat-basic
/
eq-01
list
/laddress-list/
in-append
list
/laddress-list/
in-14
list
/laddress-list/
Nil
laddress
/
inj
list-data
/laddress-list/
size-01
list-del
/address-list-set/
get-zero-01
address-data
/
inj
list
/laddress-list/
e-03
nat-basic
/
s-04
list
/address-list-set/
c
laddress
/
sel-01
laddress
/
sel-02
ablock-store-inv
/group-store/
adrs-rec
ablock-store-inv
/group-store/
to-adrs-append
nat-basic
/
oz
list
/laddress-list/
len
nat-basic
/
f
list
/laddress-list/
in-rec
nat
/
succ-01
list
/address-list-set/
a
list-del
/address-list-set/
get-succ
nat-basic
/
succ
list
/laddress-list/
len-05
list
/laddress-list/
c-06
list
/laddress-list/
c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-02
list
/laddress-list/
a