[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 8 from proof papp-03 (
previous step
)
perm(y, y0), perm(x, x0), perm(x0, x), perm(y0, y) ⊦ perm(x + y, x0 + y0)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 9
:
perm(x, x0), perm(y, y0) ⊦ perm(x + y, x0 + y0)
Rule argument
spec: inst: name: papp seq: perm(x, x0), perm(y, y0) ⊦ perm(x + y, x0 + y0) subst: [y0, x0, y, x] → [y0, x0, y, x] flags: rewrite, current
Additional information
Used terms: y0, x0, y, x