[Imprint][Data Privacy Statement][E-Mail]

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,

Theorem base for Specification remtau

This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.

Name: Sequent: Type:
remtau-empty ⊦ [] ^ = [] An Axiom
remtau-tau ⊦ (τ + α)^ = α ^ An Axiom
remtau-nontau ⊦ a ≠ τ → (a + β)^ = a + β ^ An Axiom
remtau-inftau ⊦ ⌜λ n. τ⌝ ^ = [] An Axiom
embed-fin ⊦ ⌜⌜al⌝ ^.l⌝ = ⌜al⌝ ^ A User Theorem
emptylist-emptystream ⊦ ⌜al1⌝ ^.l = [] ↔ ⌜al1⌝ ^ = [] A User Theorem
ex-first-nontauα ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) A User Theorem
listsize-notinf ⊦ # ⌜al⌝ ^ ≠ ∞ A User Theorem
not-lessto¬ # α < ⌜n⌝ ⊦ ¬ # α ^ < # (α to n)^ A User Theorem
not-lessto-finn ≤ # al ⊦ ¬ # ⌜al⌝ ^ < # ⌜al to n⌝ ^ A User Theorem
not-lessto-inf ⊦ ¬ # ⌜af⌝ ^ < # ⌜af to n⌝ ^ A User Theorem
one-eq-empty ⊦ ⌜a '⌝ ^ = [] ↔ a = τ A User Theorem
remtau-append ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^ A User Theorem
remtau-append-fin ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^ A User Theorem
remtau-cons ⊦ ⌜af⌝ ^ = ⌜a '⌝ + α → (∃ n, af0. ⌜af⌝ = ⌜mklist(τ, n)⌝ + (a + ⌜af0⌝ ) ∧ ⌜af0⌝ ^ = α) A User Theorem
remtau-double ⊦ α ^ ^ = α ^ A User Theorem
remtau-empty-equiv ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ) A User Theorem
remtau-equiv¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^) A User Theorem
remtau-fin ⊦ ¬ finp(α ^) → ¬ finp(α) A User Theorem
remtau-fin-append ⊦ (⌜al⌝ + ⌜al2⌝ )^ = ⌜al⌝ ^ + ⌜al2⌝ ^ A User Theorem
remtau-from∀ m. m < n → af(m) = τ ⊦ ⌜af⌝ ^ = (⌜af⌝ from n)^ A User Theorem
remtau-from-strong¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^ A User Theorem
remtau-inf ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) A User Theorem
remtau-isfin ⊦ finp(⌜al⌝ ^) A User Theorem
remtau-mklist ⊦ ⌜mklist(τ, n)⌝ ^ = [] A User Theorem
remtau-nontau-01∀ m. ⌜m⌝ < # α → α[m] ≠ τ ⊦ α ^ = α A User Theorem
remtau-nontau-lem ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^ A User Theorem
remtau-notcontainstau-01 ⊦ α0 ^ ≠ ⌜al0⌝ + ⌜τ '⌝ A User Theorem
remtau-notcontainstau-02 ⊦ α0 ^ ≠ ⌜τ '⌝ A User Theorem
remtau-notcontainstau-03 ⊦ α0 ^ ≠ ⌜τ '⌝ + α A User Theorem
remtau-notcontainstau-04 ⊦ α0 ^ ≠ ⌜al0⌝ + ⌜τ '⌝ + α A User Theorem
remtau-notcontainstau-05 ⊦ α0 ^ = α + ⌜τ '⌝ + β ↔ α0 ^ = α ∧ ¬ finp(α) A User Theorem
remtau-notcontainstau-06 ⊦ α0 ^ = α + ⌜τ '⌝ ↔ ¬ ¬(α0 ^ = α ∧ ¬ finp(α)) A User Theorem
remtau-notless ⊦ ¬ # α < # α ^ A User Theorem
remtau-notless-fin ⊦ ¬ ⌜# al⌝ < # ⌜al⌝ ^ A User Theorem
remtau-nottau ⊦ ⌜al⌝ ^ ≠ ⌜τ '⌝ A User Theorem
remtau-nottau-1⌜n⌝ < # α ^ ⊦ α ^[n] ≠ τ A User Theorem
remtau-nottau-2 ⊦ α ^ = ⌜af⌝ → (af(n) = τ ↔ false) A User Theorem
remtau-nottau-3n < # al ⊦ α ^ = ⌜al⌝ → (al[n] = τ ↔ false) A User Theorem
remtau-one ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ A User Theorem
remtau-onetau ⊦ ⌜τ '⌝ ^ = [] A User Theorem
remtau-split ⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) A User Theorem
remtau-strong-to ⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m) A User Theorem
remtau-tau-lem ⊦ (⌜τ '⌝ + α)^ = α ^ A User Theorem
remtau-to-notinf ⊦ ¬ # α < ⌜n⌝ → ⌜af⌝ ≠ (α to n)^ A User Theorem
remtau-to-strong ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) A User Theorem
remtau-tofin∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [] A User Theorem
remtau-tofin-strong¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ A User Theorem
remtau-weak-to ⊦ ⌜n⌝ < # α → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m) A User Theorem
remtaufin-nottaulast ⊦ ⌜al⌝ ^ ≠ [] → ⌜al⌝ ^.l.last ≠ τ A User Theorem
size-to-fin-01 ⊦ # (⌜af⌝ to n)^ ≠ ∞ A User Theorem
size-to-less ⊦ ¬ # ⌜af⌝ ^ < # (⌜af⌝ to n)^ A User Theorem
split-finite-remtau ⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []) A User Theorem
split-finite-remtau-fin ⊦ ⌜al1⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. ⌜al1⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []) A User Theorem
to-addone ⊦ ⌜m + 1⌝ < # α → (α to m)^ + ⌜α[m] '⌝ ^ = (α to m + 1)^ A User Theorem
trace-fin ⊦ ⌜al⌝ ^ ≠ ⌜af⌝ A User Theorem