[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 And-ins
⊦ ¬ a ∈ st → adP ∧_ st[a, d] = (adP(a, d) ∧ adP ∧_ st)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
And-discard
,
And-forall
,
And-unfold
,
Used by units in proved state:
Proof exists?: No