[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 reduce-unique
⊦ t => t1 ∧ t => t2 → t1 = t2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
OUTREDUCE
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 24
Used lemmas:
topred-def
,
reduction-is-topred-in-ctxt
,
Used spec theorems:
subst
/
subst-KK-equal
subst
/
subst-SK-equal
subst
/
subst-SS-equal
Used simplifier rules: