Visited.instAddMonoid
instanceimported Lean
Visited.instAddMonoid
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {A : Type*} in variable [DecidableEq A] in instance Visited.instAddMonoid : AddMonoid (Visited A)
- Defined in
- EconCSLib, `Visited.instAddMonoid`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.Visited.instAddMonoid← @EconCSLib/Foundation/CostM/Visited.lean:88 (EconCSLib/Foundation/CostM/Visited.lean:88): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 7
- Visited.instAddVisited.instAdd
- Visited.toFinsetView a
Visited Aas the underlyingFinset A. - Visited.instZeroVisited.instZero
- VisitedCost type tracking the set of sub-problem indices an algorithm touches, with
(∪, ∅)as its(+, 0)monoid. Type synonym for… - Visited.extVisited.ext
- Visited.toFinset_addVisited.toFinset_add
- Visited.toFinset_zeroVisited.toFinset_zero
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {A : Type*} in variable [DecidableEq A] in instance Visited.instAddMonoid : AddMonoid (Visited A) where add_assoc a b c := by ext; simp [Finset.union_assoc] zero_add a := by ext; simp add_zero a := by ext; simp nsmul := nsmulRec