[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 sel-embed-fin (
previous step
)
finp(σ) ⊦ ⌜σ.l⌝ = σ
Heuristic elimination applied rule insert elim lemma
And obtained the following new goals
Proof step 3
:
⊦ finp(σ) → (x = σ.l ↔ σ = ⌜x⌝ )
Rule argument
spec: stream-basic inst: name: elim seq: ⊦ finp(σ) → (x = σ.l ↔ σ = ⌜x⌝ ) subst: [σ, x] → [σ, x] flags: rewrite, current
Additional information
Used terms: σ, x