[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 (
previous step
)
a ∈ s.butmin ⊦ s = ∅, a ∈ s
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: Butmin: ⊦ s ≠ ∅ → s.butmin = s -- s.min;% ⊦ a ∈ s -- b ↔ a ≠ b ∧ a ∈ s; (ws)