[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 43 from proof initsubset-trans (conclusion)
⊦ init⊆(str, st, st0) ∧ init⊆(str, st0, st1) → init⊆(str, st, st1)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 42
:
init⊆(str, st0, st1), init⊆(str, st, st0) ⊦ init⊆(str, st, st1)
Rule argument
[emptyarg]
Additional information
[[CONCRETESIMPRULES : ()]]