Theorems · Theorem · order theory
Finset.box_succ_disjUnion
∀ {α : Type u_1} [inst : Ring α] [inst_1 : PartialOrder α] [inst_2 : IsOrderedRing α] [inst_3 : LocallyFiniteOrder α]
[inst_4 : DecidableEq α] (n : ℕ),
(Finset.box (n + 1)).disjUnion (Finset.Icc (-↑n) ↑n) ⋯ = Finset.Icc (-↑n.succ) ↑n.succ- Defined in
- Mathlib.Order.Interval.Finset.Box
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Ringstatement and proof · cited by 7,463
- PartialOrderstatement and proof · cited by 6,410
- IsOrderedRingstatement and proof · cited by 777
- LocallyFiniteOrderstatement and proof · cited by 658
- Finset.Iccstatement and proof · cited by 348
- Finset.disjUnionstatement · cited by 55
- Finset.boxstatement and proof · cited by 12
- Finset.disjUnion_eq_unionproof · cited by 12
- Finset.box_succ_union_prodproof · cited by 1
- Finset.disjoint_box_succ_prodstatement and proof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.