Theorems · Theorem · real analysis
BoxIntegral.Prepartition.injOn_setOf_mem_Icc_setOf_lower_eq
Deprecated since 2026-07-09Use BoxIntegral.Prepartition.injOn_setOfPred_mem_Icc_setOfPred_lower_eq instead.
∀ {ι : 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}Alias of BoxIntegral.Prepartition.injOn_setOfPred_mem_Icc_setOfPred_lower_eq.
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
- 0 results in Mathlib
- Foundations
- Depth 126 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.
- DFunLike.coestatement · cited by 62,936
- Setstatement · cited by 53,352
- Realstatement · cited by 25,697
- Set.ofPredstatement · cited by 6,101
- OrderEmbeddingstatement · cited by 619
- Set.InjOnstatement · cited by 543
- BoxIntegral.Boxstatement · cited by 464
- BoxIntegral.Prepartitionstatement · cited by 199
- BoxIntegral.Box.Iccstatement · cited by 76
- BoxIntegral.Box.lowerstatement · cited by 65
- BoxIntegral.Prepartition.injOn_setOfPred_mem_Icc_setOfPred_lower_eqproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.