[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 precise
⊦ precise(P) ↔ (∀ H, H0, H1, H2. P(H) ∧ P(H0) ∧ H ⊥ H1 ∧ H0 ⊥ H2 ∧ H ∪ H1 = H0 ∪ H2 → H = H0)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
precise-and
,
precise-disj
,
precise-emp
,
precise-same
,
precise-sep
,
precise-split-l
,
precise-this
,
Used by units in proved state:
maplet
,
linked-list-aux
,
linked-list
,
Proof exists?: No