[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 4 from proof sperm (
previous step
)
perm(x, sort(x)) ⊦ sort(x) = sort(y) ↔ perm(x, y)
User applied rule insert lemma
And obtained the following new goals
Proof step 5
:
⊦ perm(x, sort(x))
Proof step 6
:
perm(y, sort(y)), perm(x, sort(x)) ⊦ sort(x) = sort(y) ↔ perm(x, y)
Rule argument
spec: olist-sort inst: name: Perm seq: ⊦ perm(x, sort(x)) subst: [x] → [y] flags: current, []
Additional information
Used terms: y