[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 ins2 (
previous step
)
⊦ ins≤(a, ins≤(b, x)) = ins≤(b, ins≤(a, x))
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
⊦ ins≤(a, ins≤(b, x)) = ins≤(b, ins≤(a, x))
Rule argument
spec: olist inst: name: sw seq: ⊦ ins≤(a, ins≤(b, x)) = ins≤(b, ins≤(a, x)) subst: [x, b, a] → [x, b, a] flags: rewrite, current
Additional information
Used terms: x, b, a