[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 3 from proof shift-03 (
previous step
)
a ∈ y ⊦ perm(x + a ' + x0, y) ↔ a ∈ y ∧ perm(x + x0, y -1l a)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
a ∈ y ⊦ perm(x + a ' + x0, y) ↔ perm(x + x0, y -1l a)
Rule argument
Additional information