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