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

Is Simulation is Simulation saturate left

Cslib.LTS.IsSimulation.isSimulation_saturate_left

Plain-language statement

If the right-hand lts is saturated, a simulation lifts along saturating the left-hand lts.

Exact Lean statement

theorem IsSimulation.isSimulation_saturate_left [HasTau Label] {lts₁ : LTS State₁ Label}
    {lts₂ : LTS State₂ Label} (h : IsSimulation lts₁ lts₂.saturate r) :
    IsSimulation lts₁.saturate lts₂.saturate r

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem IsSimulation.isSimulation_saturate_left [HasTau Label] {lts₁ : LTS StateLabel}    {lts₂ : LTS StateLabel} (h : IsSimulation lts₁ lts₂.saturate r) :    IsSimulation lts₁.saturate lts₂.saturate r := by  intro s₁ s₂ hr μ s₁' h  cases h  case refl =>    use s₂, .refl, hr  case tr sb sb' hstr1 htr hstr2 =>    obtain sb1, hstr1b, hrb := IsSimulation.follow_internal h hr hstr1    obtain sb2', hstr1b', hrb' := h _ _ hrb μ _ htr    obtain s₁', hstr1', hrb2 := IsSimulation.follow_internal h hrb' hstr2    rw [sTr_τSTr_iff] at hstr1' hstr1b    use s₁', STr.comp hstr1b hstr1b' hstr1', hrb2
Project
Lean Computer Science Library
License
Apache-2.0
Commit
f36649cff2c9
Source
Cslib/Foundations/Semantics/LTS/Simulation.lean:185-197

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