[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-eq
⊦ lax0.to-adr(n) = lax1.to-adr(n) ↔ lax0 = lax1
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
prefixn-to-adrs
,
to-adrs-append
,
Used by units in proved state:
persistence-refine
,
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 10
Used lemmas:
to-adrs-in
,
adrs-rec
,
to-adrs-eq-empty
,
adrs-empty
,
Used spec theorems:
Used simplifier rules:
laddress
/
elim
list
/address-list-set/
in-14
list
/address-list-set/
app-02
list
/address-list-set/
e
list
/laddress-list/
in-rec
address-data
/
inj
list
/address-list-set/
a
list
/address-list-set/
c-06
list
/address-list-set/
c
list
/laddress-list/
c
list
/laddress-list/
a
list
/laddress-list/
app-08