[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 10 from proof perm-switch (
previous step
)
n < # y, m < # y, ∀ a. a ∈ x ∨ a ∈ y → #oc(a, x) = #oc(a, y), a ∈ x ∨ a ∈ y ⊦ y = [], #oc(a, x) = #oc(a, y)
User applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: a abort: F discard: T computed: T
Additional information
Used terms: a