Cslib.FLP.InpEqOn
defimported Lean
InpEqOn ps inp1 inp2 means that inputs inp1 and inp2 agree on all processes in ps.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Function Set Sum Multiset in variable {P M S : Type*} [DecidableEq P] [DecidableEq M] in def Cslib.FLP.InpEqOn (ps : Set P) (inp1 inp2 : P → Bool) : Prop
- Defined in
- CSLib, `Cslib.FLP.InpEqOn`
- 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.Cslib.FLP.InpEqOn← Cslib.FLP.InpEqOn (Cslib/Computability/Distributed/FLP/CanReachVia.lean:37): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Function Set Sum Multiset in variable {P M S : Type*} [DecidableEq P] [DecidableEq M] in /-- `InpEqOn ps inp1 inp2` means that inputs `inp1` and `inp2` agree on all processes in `ps`. -/ def Cslib.FLP.InpEqOn (ps : Set P) (inp1 inp2 : P → Bool) : Prop := ∀ p, p ∈ ps → inp1 p = inp2 p