Theorems · Definition · logic and foundations
List.reverseRecOn
{α : Type u_1} →
{motive : List α → Sort u_2} →
(l : List α) → motive [] → ((l : List α) → (a : α) → motive l → motive (l ++ [a])) → motive lLike reverseRec, but with the list parameter placed first.
- Defined in
- Mathlib.Data.List.Induction
- Cited by
- 29 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.reverseRecproof · cited by 5
Cited by29
Results whose statement or proof uses this declaration.
- List.minimum_consproof · cited by 7
- List.maximum_consproof · cited by 6
- List.rdrop_eq_reverse_drop_reverseproof · cited by 4
- List.permutations_perm_permutations'proof · cited by 3
- List.map_pure_sublist_sublistsproof · cited by 2
- List.not_of_mem_foldl_argAuxproof · cited by 2
- List.formPerm_apply_getLastproof · cited by 2
- List.foldl_argAux_eq_noneproof · cited by 2
- Language.accepts_toDFAproof · cited by 1
- εNFA.mem_evalFrom_iff_existsproof · cited by 1
- εNFA.mem_evalFrom_iff_exists_pathproof · cited by 1
- DFA.evalFrom_comapproof · cited by 1