[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 in-write
# ax = # ndx ⊦ adr ∈ fs[ax, ndx] ↔ adr ∈ fs ∨ adr ∈ ax
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
Used spec theorems:
Used simplifier rules:
list
/address-list-set/
c
list
/address-list-set/
len-05
nat-basic
/
succ
list
/address-list-set/
a
gjournal-base
/
in-write
list
/address-list-set/
in-rec
list-data
/address-list-set/
size-01
list-data
/node-list/
l
list-data
/node-list/
size-01
list
/address-list-set/
in-empty