Theorems · Theorem · order theory
Finset.box_succ_eq_sdiff
∀ {α : Type u_1} [inst : Ring α] [inst_1 : PartialOrder α] [IsOrderedRing α] [inst_3 : LocallyFiniteOrder α]
[inst_4 : DecidableEq α] (n : ℕ), Finset.box (n + 1) = Finset.Icc (-↑n.succ) ↑n.succ \ Finset.Icc (-↑n) ↑n- Defined in
- Mathlib.Order.Interval.Finset.Box
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Nat.cast_add_oneproof · cited by 56
- Finset.boxstatement · cited by 12
- Monotone.disjointed_add_oneproof · cited by 1
Cited by4
Results whose statement or proof uses this declaration.
- Prod.card_box_succproof · cited by 1
- Int.mem_boxproof · cited by 1
- Finset.zero_mem_boxproof · cited by 1
- Finset.disjoint_box_succ_prodproof · cited by 1