Visited.toFinset_add
theoremverifiedformalizationimported Lean
Visited.toFinset_add
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {A : Type*} in variable [DecidableEq A] in @[simp] theorem Visited.toFinset_add (a b : Visited A) : (a + b).toFinset = a.toFinset ∪ b.toFinset
- Formalizes
- EconCSLib, `Visited.toFinset_add`
- 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.toFinset_add← Visited.toFinset_add (EconCSLib/Foundation/CostM/Visited.lean:85): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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.toFinset_zeroVisited.toFinset_zero
- Used by 1
- Visited.instAddMonoidVisited.instAddMonoid
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {A : Type*} in variable [DecidableEq A] in @[simp] theorem Visited.toFinset_add (a b : Visited A) : (a + b).toFinset = a.toFinset ∪ b.toFinset := rfl