[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 8 from proof size-perm (
previous step
)
# x = # y, ∀ a. a ∈ y → a ∈ x, ∀ a. a ∈ x → a ∈ y ⊦ #oc(a0, y) ≤ #oc(a0, x), dups(x), dups(y)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 9
:
# x = # y, ∀ a. a ∈ y → a ∈ x, ∀ a. a ∈ x → a ∈ y ⊦ #oc(a0, y) ≤ #oc(a0, x), dups(x), dups(y)
Rule argument
Additional information