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