[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 3 from proof rem-preserves-monls (
previous step
)
nσ = ⌜nl⌝ , mon<(nσ) ⊦ mon<(rem(nσ, np))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
mon<(⌜nl⌝ ) ⊦ mon<(rem(⌜nl⌝ , np))
Rule argument
Additional information