AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.deterministic_tr_image_singleton

theoremverifiedformalizationimported Lean

Cslib.LTS.deterministic_tr_image_singleton

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
@[grind _=_]
theorem Cslib.LTS.deterministic_tr_image_singleton [lts.Deterministic] :
    lts.image s μ = {s'} ↔ lts.Tr s μ s'
Formalizes
CSLib, `Cslib.LTS.deterministic_tr_image_singleton`
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.
What was changed in Cslib.LTS.deterministic_tr_image_singleton
--- Cslib/Foundations/Semantics/LTS/Basic.lean:320 (Cslib.LTS.deterministic_tr_image_singleton)
+++ as compiled here
@@ -1,3 +1,8 @@
-@[scoped grind _=_]
-theorem deterministic_tr_image_singleton [lts.Deterministic] :
+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
+@[grind _=_]
+theorem Cslib.LTS.deterministic_tr_image_singleton [lts.Deterministic] :
     lts.image s μ = {s'} ↔ lts.Tr s μ s' := by
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • Cslib.LTS.DeterministicAn lts is deterministic if a state cannot reach different states with the same transition label.
  • Cslib.LTS.imageThe μ-image of a state s is the set of all μ-derivatives of s.
  • 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

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LTS inuniverse u v invariable {State : Type u} {Label : Type v} (lts : LTS State Label) in@[grind _=_]theorem Cslib.LTS.deterministic_tr_image_singleton [lts.Deterministic] :    lts.image s μ = {s'} ↔ lts.Tr s μ s' := by  have := (lts.image s μ).eq_singleton_iff_unique_mem (a := s')  grind
See it in the graphDiscuss this resultChallenge it