Theorems · Theorem · order theory
Finset.zero_mem_box
∀ {α : Type u_1} [inst : Ring α] [inst_1 : PartialOrder α] [IsOrderedRing α] [inst_3 : LocallyFiniteOrder α] {n : ℕ}
[inst_4 : DecidableEq α], 0 ∈ Finset.box n ↔ n = 0- Defined in
- Mathlib.Order.Interval.Finset.Box
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Ringstatement and proof · cited by 7,463
- PartialOrderstatement and proof · cited by 6,410
- Nat.cast_oneproof · cited by 2,501
- zero_addproof · cited by 2,366
- IsOrderedRingstatement and proof · cited by 777
- LocallyFiniteOrderstatement and proof · cited by 658
- Nat.cast_addproof · cited by 586
- Finset.Iccproof · cited by 348
- neg_add_revproof · cited by 236
- Finset.boxstatement · cited by 12
- Finset.box_succ_eq_sdiffproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Finset.eq_zero_iff_eq_zero_of_mem_boxproof · cited by 0