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 3 research declarations. Search 10,000 more complete Mathlib declarations.
3 results
Clear filtersCedar.Thm.checked_eval_entity_reachable
Plain-language statement
If an expression checks at level n and then evaluates an entity (or a record containing an entity), then that entity must reachable in n + 1 steps.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.reachable_of_mem_slice
Plain-language statement
Converse of slice_contains_reachable: every entity in the level-n slice (the reachable set computed by Entities.sliceAtLevel) is reachable in n steps. Together with reachable_then_mem_slice this gives euid ∈ slice ↔ ReachableIn, the bridge that makes Entities.closedAtLevel decide EntitiesClosedAtLevel.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.slice_contains_reachable
Project documentation
If an entity is reachable in n steps, then it must be included in slice at n. This lemma talks about the inner slicing function, so it's possible that the entity isn't in the original entities if it's in work.
Source project: Cedar Specification
Person-level attribution pending.