[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 1 from proof leqstar-alt-def (conclusion) (back to tree)

AIOAut?(AIOAut(astartf, astepf)) ⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ asl, al0. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 2 from proof leqstar-alt-def (previous step) (back to tree)

AIOAut?(AIOAut(astartf, astepf)), C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ ∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ asl, al0. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: leqstar-def: ⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)); ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ AIOAut?(AIOAut(startf, stepf)) ↔ (∃ s. startf(s)); (s) ⊦ atrace*(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ ctrace*(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 3 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: ⌜al⌝ ^ abort: F discard: T computed: F

Additional information

Used terms: ⌜al⌝ ^

Proof step 4 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ^) ∧ finp(⌜al⌝ ^) → atrace(AIOAut(astartf, astepf))(⌜al⌝ ^) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜al⌝ ^); (s)

Proof step 5 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ^) → atrace(AIOAut(astartf, astepf))(⌜al⌝ ^) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 6 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ^) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:trace, seq:⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ ^, cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al⌝ ^, cstepf, cstartf

Proof step 7 from proof leqstar-alt-def (previous step) (back to tree)

⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 8 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ∀ σ, β. ¬(⌜al⌝ ^ = β ^ ∧ cexec(CIOAut(cstartf, cstepf))(σ, β)) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 9 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ∀ σ, β. ⌜al⌝ ^ ≠ β ^ ∨ ¬ cfrag(CIOAut(cstartf, cstepf))(σ, β) ∨ ¬ cstartf(σ[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: ⌜csl⌝ , ⌜al⌝

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) Used terms: ⌜csl⌝ , ⌜al⌝

Proof step 10 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), atrace(AIOAut(astartf, astepf))(⌜al⌝ ^), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:trace, seq:⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ ^, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ ^, astepf, astartf

Proof step 11 from proof leqstar-alt-def (previous step) (back to tree)

⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 12 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ∃ σ, β. ⌜al⌝ ^ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 13 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ ^ = α ^, afrag(AIOAut(astartf, astepf))(aσ, α), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = α ^

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜al⌝ ^ = []

Additional information

Used formulas: ⌜al⌝ ^ = []

Proof step 14 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ ^ = α ^, ⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof leqstar-alt-def (previous step) (back to tree)

α ^ = [], ⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = []

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: aσ[0] ', [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) Used terms: aσ[0] ', []

Proof step 16 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ ^ = α ^, ⌜al⌝ ^ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 17 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ ^ = α ^, α ^ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = α ^

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:split-finite-remtau, seq:⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []), subst:[β, al] → [α, ⌜al⌝ ^.l]

Additional information

Used terms: α, ⌜al⌝ ^.l

Proof step 18 from proof leqstar-alt-def (previous step) (back to tree)

⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])

A spec-lemma

Proof step 19 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ ^ = α ^, α ^ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), α ^ = ⌜⌜al⌝ ^.l⌝ ∧ ⌜al⌝ ^.l ≠ [] → (∃ al0, α0. α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜⌜al⌝ ^.l⌝ ∧ al0.last = ⌜al⌝ ^.l.last ∧ α0 ^ = []) ⊦ ∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x + [] = x; (s) ⊦ [].l = []; (s) finp(σ), finp(σ0) ⊦ (σ0 + σ).l = σ0.l + σ.l; (s) ⊦ finp(⌜al⌝ ^); (s) ⊦ finp([]); (s) ⊦ σ + σ0 = σ ↔ σ0 = [] ∨ # σ = ∞; (s) ⊦ ⌜⌜al⌝ ^.l⌝ = ⌜al⌝ ^; (s) ⊦ ⌜al1⌝ ^.l = [] ↔ ⌜al1⌝ ^ = []; (s)

Proof step 20 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al0⌝ ^

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag-to, seq:⊦ afrag(AIOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → afrag*(AIOAut(startf, stepf))(σ to n + 1, α to n), subst:[n, α, σ, stepf, startf] → [# al0, ⌜al0⌝ + α0, aσ, astepf, astartf]

Additional information

Used terms: astartf, astepf, aσ, ⌜al0⌝ + α0, # al0

Proof step 21 from proof leqstar-alt-def (previous step) (back to tree)

⊦ afrag(AIOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → afrag*(AIOAut(startf, stepf))(σ to n + 1, α to n)

A spec-lemma

Proof step 22 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0) ∧ ¬ #(⌜al0⌝ + α0) < ⌜# al0⌝ → afrag*(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ + α0 to # al0) ⊦ ∃ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al0⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ to # x = ⌜x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ¬ n∞ + n∞1 < n∞1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 23 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ ∃ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al0⌝ ^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: (aσ to # al0 + 1).l, al0 abort: F discard: T computed: F

Additional information

Used terms: (aσ to # al0 + 1).l, al0

Proof step 24 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ afrag(AIOAut(astartf, astepf))(⌜(aσ to # al0 + 1).l⌝ , ⌜al0⌝ ) ∧ astartf((aσ to # al0 + 1).l[0]) ∧ ⌜al0⌝ ^ = ⌜al0⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 25 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]) ⊦ afrag(AIOAut(astartf, astepf))(⌜(aσ to # al0 + 1).l⌝ , ⌜al0⌝ ) ∧ astartf((aσ to # al0 + 1).l[0])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream-basic[traceA-IOstatestream], name:sel-embed-fin, seq: ⊦ finp(σ) → ⌜σ.l⌝ = σ, subst:[σ] → [aσ to # al0 + 1], <all paths>

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: aσ to # al0 + 1

Proof step 26 from proof leqstar-alt-def (previous step) (back to tree)

⊦ finp(σ) → ⌜σ.l⌝ = σ

A spec-lemma

Proof step 27 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), finp(aσ to # al0 + 1) ⊦ afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ) ∧ astartf((aσ to # al0 + 1).l[0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s)

Proof step 28 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ astartf((aσ to # al0 + 1).l[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceA-IOstatestream], name:get-to-02, seq:m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n).l[m] = σ[m], subst:[m, n, σ] → [0, # al0 + 1, aσ], <all paths>

Additional information

Used terms: 0, # al0 + 1, aσ

Proof step 29 from proof leqstar-alt-def (previous step) (back to tree)

m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n).l[m] = σ[m]

A spec-lemma

Proof step 30 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ astartf((aσ to # al0 + 1).l[0]) ⊦ 0 < # al0 + 1 ∧ ¬ # aσ < ⌜# al0 + 1⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 31 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ ⌜# al0⌝ < # aσ, ¬ astartf((aσ to # al0 + 1).l[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag, seq:⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al0⌝ + α0, aσ, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al0⌝ + α0, aσ, astepf, astartf

Proof step 32 from proof leqstar-alt-def (previous step) (back to tree)

⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 33 from proof leqstar-alt-def (previous step) (back to tree)

# aσ = #(⌜al0⌝ + α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(as), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ ⌜# al0⌝ < # aσ, ¬ astartf((aσ to # al0 + 1).l[0]), ∀ n. ⌜n⌝ < #(⌜al0⌝ + α0) → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf

Proof step 34 from proof leqstar-alt-def (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ ⌜# al0⌝ < # aσ, ¬ astartf((aσ to # al0 + 1).l[0]), ∀ n. ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: discard

Additional information

Used simplifier rules: ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ¬ n∞ + n∞1 < n∞1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf

Proof step 35 from proof leqstar-alt-def (previous step) (back to tree)

AIOAut?(AIOAut(astartf, astepf)), ¬ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ asl, al0. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: leqstar-def: ⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)); ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ atrace*(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ ctrace*(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ AIOAut?(AIOAut(startf, stepf)) ↔ (∃ s. startf(s)); (s)

Proof step 36 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:trace, seq:⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al⌝ , cstepf, cstartf

Proof step 37 from proof leqstar-alt-def (previous step) (back to tree)

⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 38 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^), ∃ σ, β. ⌜al⌝ = β ^ ∧ cexec(CIOAut(cstartf, cstepf))(σ, β) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 39 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ = α ^, astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: al = []

Additional information

Used formulas: al = []

Proof step 40 from proof leqstar-alt-def (previous step) (back to tree)

al = [], ⌜al⌝ = α ^, astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s)

Proof step 41 from proof leqstar-alt-def (previous step) (back to tree)

[] = α ^, astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))([]), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:trace, seq:⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [[], astepf, astartf], <all paths>

Additional information

Used terms: [], astepf, astartf

Proof step 42 from proof leqstar-alt-def (previous step) (back to tree)

⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 43 from proof leqstar-alt-def (previous step) (back to tree)

[] = α ^, astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^), ∀ σ, β. ¬([] = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 44 from proof leqstar-alt-def (previous step) (back to tree)

[] = α ^, astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^), ∀ σ, β. [] ≠ β ^ ∨ ¬ afrag(AIOAut(astartf, astepf))(σ, β) ∨ ¬ astartf(σ[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-empty-equiv, seq: ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ), subst:[α] → [α], <all paths>

Additional information

Used terms: α

Proof step 45 from proof leqstar-alt-def (previous step) (back to tree)

⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)

A spec-lemma

Proof step 46 from proof leqstar-alt-def (previous step) (back to tree)

astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ∀ σ, β. [] ≠ β ^ ∨ ¬ afrag(AIOAut(astartf, astepf))(σ, β) ∨ ¬ astartf(σ[0]), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^), ∀ n. ⌜n⌝ < # α → α[n] = τ ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: ⌜as '⌝ , [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ [] ^ = []; (s) ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) Used terms: ⌜as '⌝ , []

Proof step 47 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ = α ^, al ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:split-finite-remtau, seq:⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []), subst:[β, al] → [α, al]

Additional information

Used terms: α, al

Proof step 48 from proof leqstar-alt-def (previous step) (back to tree)

⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])

A spec-lemma

Proof step 49 from proof leqstar-alt-def (previous step) (back to tree)

⌜al⌝ = α ^, al ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), α ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α0. α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α0 ^ = []), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 50 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag-to, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → cfrag*(CIOAut(startf, stepf))(σ to n + 1, α to n), subst:[n, α, stepf, startf, σ] → [# al0, ⌜al0⌝ + α0, cstepf, cstartf, cσ]

Additional information

Used terms: cstartf, cstepf, cσ, ⌜al0⌝ + α0, # al0

Proof step 51 from proof leqstar-alt-def (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → cfrag*(CIOAut(startf, stepf))(σ to n + 1, α to n)

A spec-lemma

Proof step 52 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0) ∧ ¬ #(⌜al0⌝ + α0) < ⌜# al0⌝ → cfrag*(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ + α0 to # al0), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ cfrag*(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ to # x = ⌜x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ¬ n∞ + n∞1 < n∞1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 53 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ asl, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: (cσ to # al0 + 1).l, al0 abort: F discard: T computed: F

Additional information

Used terms: (cσ to # al0 + 1).l, al0

Proof step 54 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜(cσ to # al0 + 1).l⌝ , ⌜al0⌝ ) ∧ cstartf((cσ to # al0 + 1).l[0]) → (∃ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al0⌝ ^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜(cσ to # al0 + 1).l⌝ , ⌜al0⌝ ) ∧ cstartf((cσ to # al0 + 1).l[0]) → afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream-basic[traceC-IOstatestream], name:sel-embed-fin, seq: ⊦ finp(σ) → ⌜σ.l⌝ = σ, subst:[σ] → [cσ to # al0 + 1], <all paths>

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: cσ to # al0 + 1

Proof step 56 from proof leqstar-alt-def (previous step) (back to tree)

⊦ finp(σ) → ⌜σ.l⌝ = σ

A spec-lemma

Proof step 57 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), finp(cσ to # al0 + 1), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ) ∧ cstartf((cσ to # al0 + 1).l[0]) → afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s)

Proof step 58 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), cstartf((cσ to # al0 + 1).l[0]) → afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ ⌜al1⌝ ^ = ⌜al⌝ ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

Proof step 59 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to # al0 + 1).l[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:get-to-02, seq:m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n).l[m] = σ[m], subst:[m, n, σ] → [0, # al0 + 1, cσ], <all paths>

Additional information

Used terms: 0, # al0 + 1, cσ

Proof step 60 from proof leqstar-alt-def (previous step) (back to tree)

m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n).l[m] = σ[m]

A spec-lemma

Proof step 61 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to # al0 + 1).l[0]) ⊦ 0 < # al0 + 1 ∧ ¬ # cσ < ⌜# al0 + 1⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 62 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ¬ ⌜# al0⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to # al0 + 1).l[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al0⌝ + α0, cσ, cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al0⌝ + α0, cσ, cstepf, cstartf

Proof step 63 from proof leqstar-alt-def (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 64 from proof leqstar-alt-def (previous step) (back to tree)

# cσ = #(⌜al0⌝ + α0) + ⌜1⌝ , al0.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ¬ ⌜# al0⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to # al0 + 1).l[0]), ∀ n. ⌜n⌝ < #(⌜al0⌝ + α0) → cstepf(cσ[n], (⌜al0⌝ + α0)[n], cσ[n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf

Proof step 65 from proof leqstar-alt-def (previous step) (back to tree)

# cσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ¬ ⌜# al0⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to # al0 + 1).l[0]), ∀ n. ⌜n⌝ < ⌜# al0⌝ + # α0 → cstepf(cσ[n], (⌜al0⌝ + α0)[n], cσ[n + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: discard

Additional information

Used simplifier rules: ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ¬ n∞ + n∞1 < n∞1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf

Proof step 66 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), astartf(as), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:trace, seq:⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ , astepf, astartf

Proof step 67 from proof leqstar-alt-def (previous step) (back to tree)

⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 68 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, ⌜al1⌝ ^ = ⌜al⌝ , ⌜al0⌝ ^ = ⌜al⌝ , α0 ^ = [], al ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), astartf(asl[0]), astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cstartf(cσ[0]), ∀ σ, β. ¬(⌜al⌝ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 69 from proof leqstar-alt-def (previous step) (back to tree)

al0.last = al.last, α0 ^ = [], ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), astartf(as), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(cσ to # al0 + 1, ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜al0⌝ + α0), cstartf(cσ[0]), ∀ σ, β. ⌜al⌝ ≠ β ^ ∨ ¬ afrag(AIOAut(astartf, astepf))(σ, β) ∨ ¬ astartf(σ[0]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: ⌜asl⌝ , ⌜al1⌝

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) Used terms: ⌜asl⌝ , ⌜al1⌝

Proof Tree for leqstar-alt-def (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree