[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 3 from proof contract-wand (
previous step
)
((P0 * (P0 -* P1)))(H) ⊦ P1(H)
User applied rule apply lemma
And obtained the following new goals
Proof step 4
:
⊦ ((P0 * (P0 -* P1)))(H) → P1(H)
Rule argument
spec: <toplevel> name: sep-mp seq: ⊦ ((P0 * (P0 -* P1)))(H) → P1(H) subst: [P0, P1, H] → [P0, P1, H]
Additional information
Used terms: P0, P1, H