[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 2 from proof in-04 (
previous step
)
perm(x, y), a ∈ x ⊦ a ∈ y
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: sym-01: ⊦ perm(x, y) → perm(y, x);%in: ⊦ a ∈ y ∧ ¬ a ∈ x → ¬ perm(x, y);