Plain-language statement
Very similar to mem_make_mem_list above
Exact Lean statement
public theorem mem_values_make [LT α] [StrictLT α] [DecidableLT α] {xs : List (α × β)} :
v ∈ (Map.make xs).values → v ∈ xs.map Prod.sndFormal artifact
Lean source
public theorem mem_values_make [LT α] [StrictLT α] [DecidableLT α] {xs : List (α × β)} : v ∈ (Map.make xs).values → v ∈ xs.map Prod.snd:= by -- despite the similarity to `mem_make_mem_list`, the proof does not currently -- use `mem_make_mem_list` simp only [values, make] simp only [List.mem_map, forall_exists_index, and_imp] intro (k, v) h₁ h₂ exists (k, v) subst h₂ simp only [and_true] have h₂ := List.canonicalize_subseteq Prod.fst xs simp only [List.subset_def] at h₂ exact h₂ h₁- Project
- Cedar Specification
- License
- Apache-2.0
- Commit
- 3f093947b8ae
- Source
- cedar-lean/Cedar/Thm/Data/Map.lean:319-332
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Find? ext
Cedar.Data.Map.find?_ext
Plain-language statement
Two well-formed maps are equal if they have the same find? for every key.
Source project: Cedar Specification
Person-level attribution pending.
Find? notmem keys
Cedar.Data.Map.find?_notmem_keys
Plain-language statement
Inverse of find?_mem_toList, except that this requires wf
Source project: Cedar Specification
Person-level attribution pending.
Find? some iff in values
Cedar.Data.Map.find?_some_iff_in_values
Plain-language statement
The mp direction of this does not need the wf precondition and, in fact, is available separately as find?_some_implies_in_values above
Source project: Cedar Specification
Person-level attribution pending.