[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
,
Proof step 5 from proof eqex-trans (
previous step
)
st -- r = st0 -- r, eqex(st1, st0, r), eqex(st0, st, r), eqex(st0, st1, r) ⊦ st0 -- r = st1 -- r
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 4
:
⊦ eqex(st, st0, r) ↔ st -- r = st0 -- r
Rule argument
[crewrite-arg: eqex, F, [r, st0, st] → [r, st1, st0]]
Additional information
[[CONCRETESIMPRULES : ()], [EXTRATERMS : (r, st1, st0)]]