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