[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 1 from proof size-two-04 (conclusion)
⊦ # s ≠ 0 ∧ # s ≠ 1 ∧ a ∈ s → (∃ b. b ∈ s ∧ a ≠ b)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
a ∈ s ⊦ # s = 1, # s = 0, ∃ b. b ∈ s ∧ a ≠ b
Rule argument
Additional information