[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 remtau-equiv (conclusion) (back to tree)

¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)

Proof step 2 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^ ⊦ ⌜af1⌝ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 3 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^ ⊦ ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 4 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^ ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-strong-to, seq: ⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m), subst:[α, n] → [⌜af⌝ , n]

Additional information

Used terms: ⌜af⌝ , n

Proof step 5 from proof remtau-equiv (previous step) (back to tree)

⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m)

Lemma remtau-strong-to

Proof step 6 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^, ¬ # ⌜af⌝ < ⌜n⌝ → (∃ m. ¬ # ⌜af⌝ ^ < ⌜m⌝ ∧ (⌜af⌝ to n)^ = ⌜af⌝ ^ to m) ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 7 from proof remtau-equiv (previous step) (back to tree)

⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^ ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-to-strong, seq: ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^), subst:[α, n] → [⌜af0⌝ , n0]

Additional information

Used terms: ⌜af0⌝ , n0

Proof step 8 from proof remtau-equiv (previous step) (back to tree)

⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)

Lemma remtau-to-strong

Proof step 9 from proof remtau-equiv (previous step) (back to tree)

⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ¬ # ⌜af0⌝ ^ < ⌜n0⌝ → (∃ m. ¬ # ⌜af0⌝ < ⌜m⌝ ∧ ⌜af0⌝ ^ to n0 = (⌜af0⌝ to m)^) ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 10 from proof remtau-equiv (previous step) (back to tree)

⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n0⌝ = ⌜af0 to n1⌝ ^ ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n1 abort: F discard: T computed: T

Additional information

Used terms: n1

Proof step 11 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ ≠ ⌜af0⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality-to, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n), subst:[σ0, σ1] → [⌜af1⌝ , ⌜af0⌝ ^], <all paths>

Additional information

Used terms: ⌜af1⌝ , ⌜af0⌝ ^

Proof step 12 from proof remtau-equiv (previous step) (back to tree)

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n)

A spec-lemma

Proof step 13 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, # ⌜af1⌝ ≠ # ⌜af0⌝ ^ ∨ (∃ n. ¬(¬ # ⌜af1⌝ < ⌜n⌝ → ⌜af1⌝ to n = ⌜af0⌝ ^ to n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 14 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: finp(⌜af0⌝ ^)

Additional information

Used formulas: finp(⌜af0⌝ ^)

Proof step 15 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

term: ⌜af0⌝ ^

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ finp(⌜nf⌝ ); (s)

Proof step 16 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]

Proof step 17 from proof remtau-equiv (previous step) (back to tree)

⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

term: ⌜af⌝ ^

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s)

Proof step 18 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af2⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s)

Proof step 19 from proof remtau-equiv (previous step) (back to tree)

⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-to-strong, seq: ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^), subst:[α, n] → [⌜af⌝ , # al + 1]

Additional information

Used terms: ⌜af⌝ , # al + 1

Proof step 20 from proof remtau-equiv (previous step) (back to tree)

⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)

Lemma remtau-to-strong

Proof step 21 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ¬ # ⌜af⌝ ^ < ⌜# al + 1⌝ → (∃ m. ¬ # ⌜af⌝ < ⌜m⌝ ∧ ⌜af⌝ ^ to # al + 1 = (⌜af⌝ to m)^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (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⌝ + ⌜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)

Proof step 22 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: m abort: F discard: T computed: F

Additional information

Used terms: m

Proof step 23 from proof remtau-equiv (previous step) (back to tree)

⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∃ m0. ⌜af to m⌝ ^ = ⌜af0 to m0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 24 from proof remtau-equiv (previous step) (back to tree)

⌜af1 to # al + 1⌝ = ⌜af0 to m0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ ], <all paths>

Additional information

Used terms: ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝

Proof step 25 from proof remtau-equiv (previous step) (back to tree)

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])

A spec-lemma

Proof step 26 from proof remtau-equiv (previous step) (back to tree)

# ⌜af1 to # al + 1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ⌜n⌝ < # ⌜af1 to # al + 1⌝ → ⌜af1 to # al + 1⌝ [n] = ⌜af0 to m0⌝ ^[n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜x⌝ [n] = x[n]; (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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s)

Proof step 27 from proof remtau-equiv (previous step) (back to tree)

⌜# al⌝ + ⌜1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ∀ n. ¬ # al < n → af1(n) = ⌜af0 to m0⌝ ^[n] ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: # ⌜af0⌝ ^ < # ⌜af0 to m0⌝ ^

Additional information

Used simplifier rules: not-lessto-inf: ⊦ ¬ # ⌜af⌝ ^ < # ⌜af to n⌝ ^; Used formulas: # ⌜af0⌝ ^ < # ⌜af0 to m0⌝ ^

Proof step 28 from proof remtau-equiv (previous step) (back to tree)

⌜# al⌝ + ⌜1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ¬ # ⌜af0⌝ ^ < # ⌜af0 to m0⌝ ^, ∀ n. ¬ # al < n → af1(n) = ⌜af0 to m0⌝ ^[n] ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (s)

Proof step 29 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ¬ finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ finp(σ) → # σ = ∞; (s)

Proof step 30 from proof remtau-equiv (previous step) (back to tree)

⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af1 to n ≠ af2 to n, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-to-strong, seq: ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^), subst:[α, n] → [⌜af⌝ , n]

Additional information

Used terms: ⌜af⌝ , n

Proof step 31 from proof remtau-equiv (previous step) (back to tree)

⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)

Lemma remtau-to-strong

Proof step 32 from proof remtau-equiv (previous step) (back to tree)

⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, af1 to n ≠ af2 to n, ¬ # ⌜af⌝ ^ < ⌜n⌝ → (∃ m. ¬ # ⌜af⌝ < ⌜m⌝ ∧ ⌜af⌝ ^ to n = (⌜af⌝ to m)^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 33 from proof remtau-equiv (previous step) (back to tree)

⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n⌝ = ⌜af to n0⌝ ^, af1 to n ≠ af2 to n, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: n0 abort: F discard: T computed: F

Additional information

Used terms: n0

Proof step 34 from proof remtau-equiv (previous step) (back to tree)

⌜af1 to n⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af1 to n ≠ af2 to n, ∃ m. ⌜af to n0⌝ ^ = ⌜af0 to m⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 35 from proof remtau-equiv (previous step) (back to tree)

⌜af1 to n⌝ = ⌜af0 to n1⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n⌝ = ⌜af to n0⌝ ^, af1 to n ≠ af2 to n ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-strong-to, seq: ⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m), subst:[α, n] → [⌜af0⌝ , n1]

Additional information

Used terms: ⌜af0⌝ , n1

Proof step 36 from proof remtau-equiv (previous step) (back to tree)

⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m)

Lemma remtau-strong-to

Proof step 37 from proof remtau-equiv (previous step) (back to tree)

⌜af1 to n⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1 to n⌝ = ⌜af0 to n1⌝ ^, af1 to n ≠ af2 to n, ¬ # ⌜af0⌝ < ⌜n1⌝ → (∃ m. ¬ # ⌜af0⌝ ^ < ⌜m⌝ ∧ (⌜af0⌝ to n1)^ = ⌜af0⌝ ^ to m) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)

Proof step 38 from proof remtau-equiv (previous step) (back to tree)

⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af2 to n2 ≠ af2 to n ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: n = n2

Additional information

Used formulas: n = n2

Proof step 39 from proof remtau-equiv (previous step) (back to tree)

⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, n ≠ n2, af2 to n2 ≠ af2 to n ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: #(⌜af⌝ ^ to n) = #(⌜af0⌝ ^ to n2)

Additional information

Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) Used formulas: #(⌜af⌝ ^ to n) = #(⌜af0⌝ ^ to n2)

Proof step 40 from proof remtau-equiv (previous step) (back to tree)

⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, #(⌜af⌝ ^ to n) ≠ #(⌜af0⌝ ^ to n2), n ≠ n2, af2 to n2 ≠ af2 to n ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 41 from proof remtau-equiv (previous step) (back to tree)

⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, af2 to n2 ≠ af2 to n ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[x, y] → [af2 to n2, af2 to n], <all paths>

Additional information

Used terms: af2 to n2, af2 to n

Proof step 42 from proof remtau-equiv (previous step) (back to tree)

⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])

A spec-lemma

Proof step 43 from proof remtau-equiv (previous step) (back to tree)

⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, #(af2 to n2) ≠ #(af2 to n) ∨ (∃ n0. ¬(n0 < #(af2 to n2) → (af2 to n2)[n0] = (af2 to n)[n0])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ #(nf to n) = n; (s)

Proof step 44 from proof remtau-equiv (previous step) (back to tree)

⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, n2 ≠ n ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[x, y] → [af1 to n, af2 to n2], <all paths>

Additional information

Used simplifier rules: ⊦ #(nf to n) = n; (s) Used terms: af1 to n, af2 to n2

Proof step 45 from proof remtau-equiv (previous step) (back to tree)

⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])

A spec-lemma

Proof Tree for remtau-equiv (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