[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 2 from proof append-split (
previous step
)
# σ = # σ1, finp(σ) ⊦ σ + σ0 = σ1 + σ2 ↔ σ = σ1 ∧ σ0 = σ2
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
# σ = # σ1, σ + σ0 = σ1 + σ2, finp(σ) ⊦ σ = σ1 ∧ σ0 = σ2
Rule argument
Additional information