[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 lift-unknown (
previous step
)
∃ rs0, rs1. rs0 ∪ rs1 = rs ∧ rs0 ∩ rs1 = ∅ ∧ r ==>(o, a)[rs0, f, g] ∧ R[rs1, f, g] ⊦ (a[r =>_] * R)[rs, f, g]
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 9
:
rs1 ∩ rs0 = ∅, r ==>(o, a)[rs1, f, g], R[rs0, f, g] ⊦ (a[r =>_] * R)[rs1 ∪ rs0, f, g]
Rule argument
Additional information