[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 REFINE
REFINE(X, F; A, D, P){while X ≠ [] do {REFINEONE(X.head, F; A, D, P); X := X.tail}}
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
REFINE-theorem
,
Used by units in proved state:
partition-refinement-test
,
Proof exists?: No