AFTD Auto-Formalizing Theoretical Domains

Cslib.FLP.DestIn

defimported Lean

DestIn ps x means that if x ≠ none, then x = some m with m.dest ∈ ps.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Sum Multiset in
variable {P M S : Type*} [DecidableEq P] [DecidableEq M] in
def Cslib.FLP.DestIn (ps : Set P) : Action P M → Prop
Defined in
CSLib, `Cslib.FLP.DestIn`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Ching-Tsun Chou. 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 listed
Built on 2
  • Cslib.FLP.MessageThe type of messages that processes send to each other.
  • Cslib.FLP.ActionThe type of labels of the LTS defined by an Algorithm, where some m denotes the reception of message m and none denotes a…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Sum Multiset in
variable {P M S : Type*} [DecidableEq P] [DecidableEq M] in
/-- `DestIn ps x` means that if `x ≠ none`, then `x = some m` with `m.dest ∈ ps`. -/
def Cslib.FLP.DestIn (ps : Set P) : Action P M → Prop
  | some m => m.dest ∈ ps
  | none => True
See it in the graphDiscuss this resultChallenge it