[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-eq-ext (
previous step
)
∃ a. ¬(a ∈ s0 ↔ a ∈ s1), ∀ a. a ∈ s0 ↔ a ∈ s1 ⊦ # s0 = # s1
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
∀ a. a ∈ s0 ↔ a ∈ s1 ⊦ # s0 = # s1, a ∈ s0 ↔ a ∈ s1
Rule argument
Additional information