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