[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 7 from proof perm-rev-01 (
previous step
)
perm(x, rev(y)), perm(rev(y), x) ⊦ perm(x, y), perm(rev(y), y)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 8
:
⊦ perm(x, y) ↔ perm(y, x)
Rule argument
spec: inst: name: sym seq: ⊦ perm(x, y) ↔ perm(y, x) subst: [y, x] → [y, rev(y)] flags: rewrite, current
Additional information
Used simplifier rules: perm-rev: ⊦ perm(x, rev(x)); Used terms: y, rev(y)