Theorems · Definition · order theory
ENat.recTopCoe
{C : ℕ∞ → Sort u_1} → C ⊤ → ((a : ℕ) → C ↑a) → (n : ℕ∞) → C nRecursor for ENat using the preferred forms ⊤ and ↑a.
- Defined in
- Mathlib.Data.ENat.Defs
- Cited by
- 75 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by77
Results whose statement or proof uses this declaration.
- FiniteMultiplicity.emultiplicity_eq_multiplicityproof · cited by 31
- Ring.ordMonoidWithZeroHomproof · cited by 12
- ENat.natCast_toNat_eq_selfproof · cited by 9
- AnalyticAt.meromorphicOrderAt_eqproof · cited by 9
- PowerSeries.le_orderproof · cited by 7
- ENat.one_epowproof · cited by 7
- MvPowerSeries.le_weightedOrderproof · cited by 7
- ENat.natCast_toNat_le_selfproof · cited by 6
- IsDiscreteValuationRing.idealOrderIsoENatproof · cited by 5
- Order.height_le_coe_iffproof · cited by 5
- ENat.ceil_leproof · cited by 4
- ENat.toNat_eq_iffproof · cited by 4