[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 9 from proof valid-eraseqd-rem-middle (
previous step
)
valid-eraseq(q + q1), valid-eraseq(q + eqent ' + q1), m ∈ q + q1, ∀ eqent, q1. valid-eraseq(q + eqent ' + q1) → valid-eraseq(q + q1) ⊦ m ∈ q, m ∈ eqent ', m ∈ q1
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 10
:
⊦ n ∈ q0 + q1 ↔ n ∈ q0 ∨ n ∈ q1
Rule argument
spec: erasequeue name: in-concat seq: ⊦ n ∈ q0 + q1 ↔ n ∈ q0 ∨ n ∈ q1 subst: [q1, q0, n] → [q1, q, m] flags: <all paths>
Additional information
Used terms: q1, q, m