[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 to-adrs-drop
⊦ dropn(n, lax.to-adr(m)) = dropn(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: 3
Proof steps: 11
Used lemmas:
adrs-rec
,
adrs-empty
,
Used spec theorems:
list-prefixn
/address-list-set/
dropn-first
list-prefixn
/laddress-list/
dropn-first
Used simplifier rules:
list-prefixn
/address-list-set/
dropn-empty
list-prefixn
/laddress-list/
dropn-empty
list
/laddress-list/
c
laddress
/
elim
list-prefixn
/address-list-set/
dropn-0
list-prefixn
/laddress-list/
dropn-0
laddress
/
sel-02
laddress
/
sel-01
list
/address-list-set/
c
list
/address-list-set/
app-08
list
/address-list-set/
c-07
list
/address-list-set/
a
list
/address-list-set/
e-01
nat
/
elim-pred-c
nat-basic
/
z-01
nat-basic
/
oz
list
/laddress-list/
c-07
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
add-01
list
/laddress-list/
a
list
/laddress-list/
e-01