[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 septract-given (
previous step
)
((P0 * P1))(H1 ∪ H), P0(H1), precise(P0), H1 ⊥ H ⊦ P1(H)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 7
:
precise(P0) ⊦ P0(H0) ∧ H0 ⊥ H1 → (((P0 * P1))(H0 ∪ H1) ↔ P1(H1))
Rule argument
spec: <toplevel> name: precise-split-l seq: precise(P0) ⊦ P0(H0) ∧ H0 ⊥ H1 → (((P0 * P1))(H0 ∪ H1) ↔ P1(H1)) subst: [H1, H0, P1, P0] → [H, H1, P1, P0] flags: <all paths>
Additional information
Used terms: H, H1, P1, P0