Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 18 research declarations. Search 10,000 more complete Mathlib declarations.
18 results
Clear filtersCedar.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.
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.
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.
Cedar.Data.Map.in_list_iff_find?_some
Plain-language statement
The mpr direction of this does not need the wf precondition and, in fact, is available separately as find?_mem_toList above
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Data.Map.map_make_append_find_disjoint
Plain-language statement
If a key exists in l₂ but not in l₁, then Map.make (l₁ ++ l₂) contains that key.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Data.Map.map_make_append_find_disjoint'
Plain-language statement
A variant of map_make_append_find_disjoint.
Source project: Cedar Specification
Person-level attribution pending.