[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 Data-in-other
⊦ ¬ a ∈ st → (d0 ∈ st[a, d1] ↔ d0 ∈ st ∨ d0 = d1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
Data-in
,
Data-notin-other
,
Used spec theorems:
Used simplifier rules:
store
/
At-same
store
/
insin
store
/
At-in-out
store
/
In-insert