[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 ladr-split
⊦ lax.to-adr(n) = ax0 + ax1 ↔ (∃ lax0, lax1. lax = lax0 + lax1 ∧ ax0 = lax0.to-adr(n) ∧ ax1 = lax1.to-adr(n))
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
Used spec theorems:
Used simplifier rules:
ablock-store-inv
/group-store/
adrs-empty
list
/address-list-set/
app-02
list
/laddress-list/
c
laddress
/
elim
list
/address-list-set/
in-append
list
/address-list-set/
in-14
list
/address-list-set/
Nil
list
/address-list-set/
in-empty
ablock-store-inv
/group-store/
to-adrs-eq-empty
list
/laddress-list/
Nil
list
/address-list-set/
in-rec
list
/address-list-set/
c-06
ablock-store-inv
/group-store/
to-adrs-append
list
/laddress-list/
a
list
/address-list-set/
app-01
list
/address-list-set/
a
ablock-store-inv
/group-store/
to-adrs-eq
list
/laddress-list/
app-03
ablock-store-inv
/group-store/
adrs-rec
laddress
/
sel-02
laddress
/
sel-01
list
/address-list-set/
c
list
/address-list-set/
app-08