[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 1 from proof no-progress-fw (conclusion)
⊦ P-restr(pm, ¬ P, I, R) ∧ ¬ P(pm, s) ∧ R(pm, s, s0) ∧ I(pm, s) ∧ I(pm, s0) → ¬ P(pm, s0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
I(pm, s0), I(pm, s), R(pm, s, s0), P-restr(pm, ¬ P, I, R), P(pm, s0) ⊦ P(pm, s)
Rule argument
Additional information