All proofs
Project-declaredLean 4.33.0-rc1 · mathlib@169c26b52a38

Omega Execution flatten m Tr

Cslib.LTS.OmegaExecution.flatten_mTr

Plain-language statement

Concatenating an infinite sequence of multistep transitions.

Exact Lean statement

theorem OmegaExecution.flatten_mTr [Inhabited Label]
    {ts : ωSequence State} {μls : ωSequence (List Label)}
    (hmtr : ∀ k, lts.MTr (ts k) (μls k) (ts (k + 1))) (hpos : ∀ k, (μls k).length > 0) :
    ∃ ss, lts.OmegaExecution ss μls.flatten ∧ ∀ k, ss (μls.cumLen k) = ts k

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem OmegaExecution.flatten_mTr [Inhabited Label]    {ts : ωSequence State} {μls : ωSequence (List Label)}    (hmtr :  k, lts.MTr (ts k) (μls k) (ts (k + 1))) (hpos :  k, (μls k).length > 0) :     ss, lts.OmegaExecution ss μls.flatten   k, ss (μls.cumLen k) = ts k := by  choose sls h_sls using fun k  Execution.of_mTr (hmtr k)  obtain ss, h_ss, h_seg := OmegaExecution.flatten_execution h_sls hpos  use ss, h_ss  intro k  have : ss.extract (μls.cumLen k) (μls.cumLen (k + 1))  [] := by grind  have h1 : 0 < (ss.extract (μls.cumLen k) (μls.cumLen (k + 1))).length :=    List.length_pos_iff.mpr this  grind [List.getElem_of_eq (h_seg k) h1]
Project
Lean Computer Science Library
License
Apache-2.0
Commit
f36649cff2c9
Source
Cslib/Foundations/Semantics/LTS/OmegaExecution.lean:108-119

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.33.0-rc1

Unique minimal

Cslib.Automata.DA.FinAcc.unique_minimal

Plain-language statement

The minimal DFA M accepting the language l is unique up to unique isomorphism.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Buchi Family cover

Cslib.Automata.NA.Buchi.buchiFamily_cover

Project documentation

na.buchiFamily is a cover if na has only finitely many states. This theorem uses the Ramsey theorem for infinite graphs and does not depend on any details of na.BuchiCongruence other than that it is of finite index.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record