Cslib.LTS.mapLabel_tr
theoremverifiedformalizationimported Lean
Cslib.LTS.mapLabel_tr
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[simp] theorem Cslib.LTS.mapLabel_tr {lts : LTS State Label₁} : (lts.mapLabel f).Tr s μ s' ↔ lts.Tr s (f μ) s'
- Formalizes
- CSLib, `Cslib.LTS.mapLabel_tr`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Fabrizio Montesi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.LTS.mapLabel_tr← Cslib.LTS.mapLabel_tr (Cslib/Foundations/Semantics/LTS/MapLabel.lean:27): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- Cslib.LTS.mapLabelConstructs an LTS by mapping its labels into those of an existing LTS.
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true in@[simp]theorem Cslib.LTS.mapLabel_tr {lts : LTS State Label₁} : (lts.mapLabel f).Tr s μ s' ↔ lts.Tr s (f μ) s' := by rfl