[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 6 from proof precise-split-r (
previous step
)
((P0 * P1))(H1 ∪ H0), P1(H1), precise(P1), H0 ⊥ H1 ⊦ P0(H0)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 7
:
⊦ P0 * P1 = P1 * P0
Proof step 8
:
((P1 * P0))(H1 ∪ H0), P1(H1), precise(P1), H0 ⊥ H1 ⊦ P0(H0)
Rule argument
spec: <toplevel> name: sep-com seq: ⊦ P0 * P1 = P1 * P0 subst: [P1, P0] → [P1, P0] flags: <all paths>
Additional information
Used terms: P1, P0