[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 topred-def
⊦ t =>top t' ↔ (∃ v1, v2. t = K _ v1 _ v2 ∧ t' = v1 ∧ value(v1) ∧ value(v2)) ∨ (∃ v1, v2, v3. t = S _ v1 _ v2 _ v3 ∧ t' = v1 _ v3 _ (v2 _ v3) ∧ value(v1) ∧ value(v2) ∧ value(v3))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
K-does-not-top-reduce
,
K-top-reduce
,
S-does-not-top-reduce
,
S-top-reduce
,
irred-top
,
irred-top-01
,
reduce-unique
,
reduction-is-topred-in-ctxt
,
topred-unique
,
Used by units in proved state:
OUTREDUCE
,
Proof exists?: No