Source-pinned research

Research proof index

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 5 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

5 results

Clear filters
Project-declaredLean 4.31.0

Drop add Cases right

Fin.drop_addCases_right

Plain-language statement

Dropping the first n + m elements of an addCases u v, where v is a n'-tuple and m ≤ n', is the same as dropping the first m elements of v.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Drop append left

Fin.drop_append_left

Plain-language statement

Version of drop_addCases_left that specializes addCases to append.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Drop append right

Fin.drop_append_right

Plain-language statement

Version of drop_addCases_right that specializes addCases to append.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Drop update of ge

Fin.drop_update_of_ge

Plain-language statement

drop commutes with update for indices at or after the drop point.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Take drop add Cases

Fin.take_drop_addCases'

Plain-language statement

The concatenation of the first m elements and the last n - m elements of a tuple is the same as the original tuple.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record