Theorems · Theorem · real analysis
BoxIntegral.Prepartition.injOn_setOfPred_mem_Icc_setOfPred_lower_eq
∀ {ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (x : ι → ℝ),
Set.InjOn (fun J => {i | J.lower i = x i}) {J | J ∈ π ∧ x ∈ BoxIntegral.Box.Icc J}An auxiliary lemma used to prove that the same point can't belong to more than
2 ^ Fintype.card ι closed boxes of a prepartition.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 125 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Realstatement and proof · cited by 25,697
- Set.ofPredstatement and proof · cited by 6,101
- Set.Nonemptyproof · cited by 2,627
- Set.Iocproof · cited by 971
- LT.lt.neproof · cited by 872
- OrderEmbeddingstatement · cited by 619
- Set.InjOnstatement · cited by 543
- BoxIntegral.Boxstatement and proof · cited by 464
- LE.le.eq_or_ltproof · cited by 220
- BoxIntegral.Prepartitionstatement and proof · cited by 199
Cited by2
Results whose statement or proof uses this declaration.
- BoxIntegral.Prepartition.card_filter_mem_Icc_leproof · cited by 1
- BoxIntegral.Prepartition.injOn_setOf_mem_Icc_setOf_lower_eqproof · cited by 0