Theorems · Definition · order theory
WithBot.recBotCoe
{α : Type u_1} → {C : WithBot α → Sort u_2} → C ⊥ → ((a : α) → C ↑a) → (n : WithBot α) → C nRecursor for WithBot using the preferred forms ⊥ and ↑a.
- Defined in
- Mathlib.Order.TypeTags
- Cited by
- 101 results in Mathlib
- Foundations
- Depth 5 from the axioms, rests on 12 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement and proof · cited by 4,720
- WithBotstatement and proof · cited by 1,498
- WithBot.somestatement and proof · cited by 541
Cited by104
Results whose statement or proof uses this declaration.
- WithBot.unbotDproof · cited by 49
- WithBot.succproof · cited by 30
- WithBot.add_botproof · cited by 20
- Polynomial.modByMonic_X_sub_C_eq_C_evalproof · cited by 7
- WithBot.lt_coe_botproof · cited by 7
- WithBot.map₂_bot_rightproof · cited by 6
- WithBot.some_eq_map_iffproof · cited by 4
- Interval.recBotCoeproof · cited by 4
- BoxIntegral.Box.coe_infproof · cited by 3
- WithBot.le_iff_forallproof · cited by 3
- WithBot.le_of_add_le_add_leftproof · cited by 3
- WithBot.add_eq_botproof · cited by 3