AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.MTr.nil_iff

theoremverifiedformalizationimported Lean

Cslib.LTS.MTr.nil_iff

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) in
@[simp] theorem Cslib.LTS.MTr.nil_iff (s1 s2 : State) : lts.MTr s1 [] s2 ↔ s1 = s2
Formalizes
CSLib, `Cslib.LTS.MTr.nil_iff`
Lean proof
By Fabrizio Montesi, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 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.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 3
  • Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
  • Cslib.LTS.MTr.nil_eqIn any zero-steps multistep transition, the origin and the derivative are the same.
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…
Used by 34

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) in
@[simp] theorem Cslib.LTS.MTr.nil_iff (s1 s2 : State) : lts.MTr s1 [] s2 ↔ s1 = s2 :=
  ⟨nil_eq lts, fun h => h ▸ MTr.refl⟩
See it in the graphDiscuss this resultChallenge it