[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 6 from proof size-two (
previous step
)
a ∈ s, # s = 2, a ∈ s ⊦ ∃ a, b. a ≠ b ∧ s = ∅ ++ a ++ b
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
# s = 2, a ∈ s ⊦ ∃ a, b. a ≠ b ∧ s = ∅ ++ a ++ b
Rule argument
Additional information