[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 5 from proof ls-add (
previous step
)
¬ a < b, ∀ b0. b0 ∈ s → b0 < b ⊦ ¬(∀ b0. b0 = a ∨ b0 ∈ s → b0 < b)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
∀ b0. b0 = a ∨ b0 ∈ s → b0 < b, ∀ b0. b0 ∈ s → b0 < b ⊦ a < b
Rule argument
Additional information