[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 sym-01 (
previous step
)
perm(x, y) ⊦ perm(y, x)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
⊦ perm(x, y) ↔ perm(y, x)
Rule argument
spec: <toplevel> name: sym seq: ⊦ perm(x, y) ↔ perm(y, x) subst: [x, y] → [y, x] flags: <rotated> <all paths>
Additional information
Used terms: y, x