[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 2 from proof bmin-nin-02 (
previous step
)
a ∈ s ⊦ a = s.min, a ∈ s.butmin
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: bmin-in-01: ⊦ a ∈ s ∧ a ≠ s.min → a ∈ s.butmin;