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

Is Bisimulation Up To is Bisimulation

Cslib.LTS.IsBisimulationUpTo.isBisimulation

Plain-language statement

Any bisimulation up to bisimilarity is a bisimulation.

Exact Lean statement

@[scoped grind →]
theorem IsBisimulationUpTo.isBisimulation (h : IsBisimulationUpTo lts₁ lts₂ r) :
    IsBisimulation lts₁ lts₂ (UpToHomBisimilarity lts₁ lts₂ r)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
@[scoped grind ]theorem IsBisimulationUpTo.isBisimulation (h : IsBisimulationUpTo lts₁ lts₂ r) :    IsBisimulation lts₁ lts₂ (UpToHomBisimilarity lts₁ lts₂ r) := by  intro s₁ s₂ hr μ  rcases hr with s₁b, hr1b, s₂b, hrb, hr2b  constructor  case left =>    intro s₁' htr1    obtain s₁b', hs₁b'tr, hs₁b'r := hr1b.follow_fst htr1    obtain s₂b', hs₂b'tr, hs₂b'r := (h hrb μ).1 s₁b' hs₁b'tr    obtain s₂', hs₂btr, hs₂br := hr2b.follow_fst hs₂b'tr    use s₂', hs₂btr    obtain smid1, hsmidb, smid2, hsmidr, hsmidrb := hs₂b'r    use smid1, hs₁b'r.trans hsmidb, smid2, hsmidr    exact hsmidrb.trans hs₂br  case right =>    intro s₂' htr2    obtain s₂b', hs₂b'tr, hs₂b'r := hr2b.follow_snd htr2    obtain s₁b', hs₁b'tr, hs₁b'r := (h hrb μ).2 s₂b' hs₂b'tr    obtain s₁', hs₁btr, hs₁br := hr1b.follow_snd hs₁b'tr    use s₁', hs₁btr    obtain smid1, hsmidb, smid2, hsmidr, hsmidrb := hs₁b'r    use smid1, hs₁br.trans hsmidb, smid2, hsmidr    exact hsmidrb.trans hs₂b'r
Project
Lean Computer Science Library
License
Apache-2.0
Commit
f36649cff2c9
Source
Cslib/Foundations/Semantics/LTS/Bisimulation.lean:283-306

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