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 22 research declarations. Search 10,000 more complete Mathlib declarations.
22 results
Clear filtersCedar.Thm.disjointOpt?_eqv_disjoint?
Plain-language statement
Full equivalence for disjoint? and disjointOpt?, including both the .ok and .error cases
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.disjointOpt?_eqv_disjoint?_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then wellTypedPolicies succeeds and disjoint? and disjointOpt? are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.equivalentOpt?_eqv_equivalent?
Plain-language statement
Full equivalence for equivalent? and equivalentOpt?, including both the .ok and .error cases
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.equivalentOpt?_eqv_equivalent?_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then wellTypedPolicies succeeds and equivalent? and equivalentOpt? are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.impliesOpt?_eqv_implies?
Plain-language statement
Full equivalence for implies? and impliesOpt?, including both the .ok and .error cases
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.impliesOpt?_eqv_implies?_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then wellTypedPolicies succeeds and implies? and impliesOpt? are equivalent.
Source project: Cedar Specification
Person-level attribution pending.