[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 referenced-adrs-split-one
⊦ referenced-adrs(ax, ri) = adr ' ↔ (∃ ax0, ax1. ax = ax0 + adr ' + ax1 ∧ referenced-adrs(ax0, ri) = [] ∧ referenced-adrs(ax1, ri) = [] ∧ adr ∈ ri)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
referenced-adrs-eq-one-lookup
,
referenced-adrs-lookup-keys-nodups
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 20
Used lemmas:
referenced-adrs-in
,
referenced-adrs-one
,
referenced-adrs-base
,
referenced-adrs-rec
,
referenced-adrs-app
,
Used spec theorems:
Used simplifier rules:
list
/address-list-set/
eq-04
list
/address-list-set/
e
list
/address-list-set/
c-03
list
/address-list-set/
in-append
list
/address-list-set/
in-14
list
/address-list-set/
c
list
/address-list-set/
a
list
/address-list-set/
app-08
list
/address-list-set/
Nil