Loogle!
Result
Found 216 declarations mentioning BoxIntegral.Prepartition. Of these, only the first 200 are shown.
- BoxIntegral.Prepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} (I : BoxIntegral.Box ι) : Type u_1 - BoxIntegral.Prepartition.IsPartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : Prop - BoxIntegral.Prepartition.instInhabited 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : Inhabited (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.instLE 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : LE (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.instSemilatticeInf 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : SemilatticeInf (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.partialOrder 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : PartialOrder (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (self : BoxIntegral.Prepartition I) : Finset (BoxIntegral.Box ι) - BoxIntegral.Prepartition.distortion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) [Fintype ι] : NNReal - BoxIntegral.Prepartition.iUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : Set (ι → ℝ) - BoxIntegral.Prepartition.instMembershipBox 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : Membership (BoxIntegral.Box ι) (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.instOrderBot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : OrderBot (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.instOrderTop 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : OrderTop (BoxIntegral.Prepartition I) - BoxIntegral.Prepartition.restrict 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (J : BoxIntegral.Box ι) : BoxIntegral.Prepartition J - BoxIntegral.Prepartition.filter 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (p : BoxIntegral.Box ι → Prop) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.injective_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : Function.Injective BoxIntegral.Prepartition.boxes - BoxIntegral.Prepartition.biUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.biUnionIndex 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) (J : BoxIntegral.Box ι) : BoxIntegral.Box ι - BoxIntegral.Prepartition.single 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} (I J : BoxIntegral.Box ι) (h : J ≤ I) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.restrict_self 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : π.restrict I = π - BoxIntegral.Prepartition.IsPartition.nonempty_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} (h : π.IsPartition) : π.boxes.Nonempty - BoxIntegral.Prepartition.filter_true 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : (π.filter fun x => True) = π - BoxIntegral.Prepartition.iUnion_subset 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : π.iUnion ⊆ ↑I - BoxIntegral.Prepartition.isPartitionTop 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} (I : BoxIntegral.Box ι) : ⊤.IsPartition - BoxIntegral.Prepartition.IsPartition.iUnion_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} (h : π.IsPartition) : π.iUnion = ↑I - BoxIntegral.Prepartition.filter_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (p : BoxIntegral.Box ι → Prop) : π.filter p ≤ π - BoxIntegral.Prepartition.isPartition_iff_iUnion_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} : π.IsPartition ↔ π.iUnion = ↑I - BoxIntegral.Prepartition.biUnion_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : π.biUnion πi ≤ π - BoxIntegral.Prepartition.biUnionIndex_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) (J : BoxIntegral.Box ι) : π.biUnionIndex πi J ≤ I - BoxIntegral.Prepartition.le_of_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (hJ : J ∈ π) : J ≤ I - BoxIntegral.Prepartition.iUnion_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : ⊤.iUnion = ↑I - BoxIntegral.Prepartition.IsPartition.restrict 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} (h : π.IsPartition) (hJ : J ≤ I) : (π.restrict J).IsPartition - BoxIntegral.Prepartition.IsPartition.iUnion_subset 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} (h : π.IsPartition) (π₁ : BoxIntegral.Prepartition I) : π₁.iUnion ⊆ π.iUnion - BoxIntegral.Prepartition.distortion_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} [Fintype ι] (I : BoxIntegral.Box ι) : ⊤.distortion = I.distortion - BoxIntegral.Prepartition.notMem_bot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} : J ∉ ⊥ - BoxIntegral.Prepartition.biUnion_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : (π.biUnion fun x => ⊤) = π - BoxIntegral.Prepartition.bot_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : ⊥.boxes = ∅ - BoxIntegral.Prepartition.distortion_bot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} [Fintype ι] (I : BoxIntegral.Box ι) : ⊥.distortion = 0 - BoxIntegral.Prepartition.iUnion_bot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : ⊥.iUnion = ∅ - BoxIntegral.Prepartition.restrict_boxes_of_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (h : I ≤ J) : (π.restrict J).boxes = π.boxes - BoxIntegral.Prepartition.iUnion_mono 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h : π₁ ≤ π₂) : π₁.iUnion ⊆ π₂.iUnion - BoxIntegral.Prepartition.subset_iUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (h : J ∈ π) : ↑J ⊆ π.iUnion - BoxIntegral.Prepartition.IsPartition.inf 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h₁ : π₁.IsPartition) (h₂ : π₂.IsPartition) : (π₁ ⊓ π₂).IsPartition - BoxIntegral.Prepartition.filter_of_true 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {p : BoxIntegral.Box ι → Prop} (hp : ∀ J ∈ π, p J) : π.filter p = π - BoxIntegral.Prepartition.iUnion_restrict 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : (π.restrict J).iUnion = ↑J ∩ π.iUnion - BoxIntegral.Prepartition.lower_le_lower 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (hJ : J ∈ π) : I.lower ≤ J.lower - BoxIntegral.Prepartition.monotone_restrict 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} : Monotone fun π => π.restrict J - BoxIntegral.Prepartition.top_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} : ⊤.boxes = {I} - BoxIntegral.Prepartition.upper_le_upper 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (hJ : J ∈ π) : J.upper ≤ I.upper - BoxIntegral.Prepartition.le_of_mem' 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (self : BoxIntegral.Prepartition I) (J : BoxIntegral.Box ι) : J ∈ self.boxes → J ≤ I - BoxIntegral.Prepartition.mem_single 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J J' : BoxIntegral.Box ι} (h : J ≤ I) : J' ∈ BoxIntegral.Prepartition.single I J h ↔ J' = J - BoxIntegral.Prepartition.mem_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} : J ∈ ⊤ ↔ J = I - BoxIntegral.Prepartition.distortion_le_of_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) [Fintype ι] (h : J ∈ π) : J.distortion ≤ π.distortion - BoxIntegral.Prepartition.filter_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (p : BoxIntegral.Box ι → Prop) : (π.filter p).boxes = {J ∈ π.boxes | p J} - BoxIntegral.Prepartition.inf_def 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π₁ π₂ : BoxIntegral.Prepartition I) : π₁ ⊓ π₂ = π₁.biUnion fun J => π₂.restrict J - BoxIntegral.Prepartition.restrict_mono 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (Hle : π₁ ≤ π₂) : π₁.restrict J ≤ π₂.restrict J - BoxIntegral.Prepartition.restrict_biUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) (hJ : J ∈ π) : (π.biUnion πi).restrict J = πi J - BoxIntegral.Prepartition.ext 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h : ∀ (J : BoxIntegral.Box ι), J ∈ π₁ ↔ J ∈ π₂) : π₁ = π₂ - BoxIntegral.Prepartition.le_biUnionIndex 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (hJ : J ∈ π.biUnion πi) : J ≤ π.biUnionIndex πi J - BoxIntegral.Prepartition.mem_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : J ∈ π.boxes ↔ J ∈ π - BoxIntegral.Prepartition.ext_iff 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} : π₁ = π₂ ↔ ∀ (J : BoxIntegral.Box ι), J ∈ π₁ ↔ J ∈ π₂ - BoxIntegral.Prepartition.iUnion_eq_empty 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ : BoxIntegral.Prepartition I} : π₁.iUnion = ∅ ↔ π₁ = ⊥ - BoxIntegral.Prepartition.mem_filter 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {p : BoxIntegral.Box ι → Prop} : J ∈ π.filter p ↔ J ∈ π ∧ p J - BoxIntegral.Prepartition.IsPartition.biUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (h : π.IsPartition) (hi : ∀ J ∈ π, (πi J).IsPartition) : (π.biUnion πi).IsPartition - BoxIntegral.Prepartition.distortion_biUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} [Fintype ι] (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnion πi).distortion = π.boxes.sup fun J => (πi J).distortion - BoxIntegral.Prepartition.IsPartition.eq_of_boxes_subset 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h₁ : π₁.IsPartition) (h₂ : π₁.boxes ⊆ π₂.boxes) : π₁ = π₂ - BoxIntegral.Prepartition.biUnionIndex_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (hJ : J ∈ π.biUnion πi) : π.biUnionIndex πi J ∈ π - BoxIntegral.Prepartition.distortion_of_const 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) [Fintype ι] {c : NNReal} (h₁ : π.boxes.Nonempty) (h₂ : ∀ J ∈ π, J.distortion = c) : π.distortion = c - BoxIntegral.Prepartition.eq_of_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J₁ J₂ : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (h₁ : J₁ ∈ π) (h₂ : J₂ ∈ π) (hle : J₁ ≤ J₂) : J₁ = J₂ - BoxIntegral.Prepartition.iUnion_filter_not 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (p : BoxIntegral.Box ι → Prop) : (π.filter fun J => ¬p J).iUnion = π.iUnion \ (π.filter p).iUnion - BoxIntegral.Prepartition.iUnion_inf 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π₁ π₂ : BoxIntegral.Prepartition I) : (π₁ ⊓ π₂).iUnion = π₁.iUnion ∩ π₂.iUnion - BoxIntegral.Prepartition.iUnion_biUnion_partition 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (h : ∀ J ∈ π, (πi J).IsPartition) : (π.biUnion πi).iUnion = π.iUnion - BoxIntegral.Prepartition.IsPartition.existsUnique 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} {x : ι → ℝ} (h : π.IsPartition) (hx : x ∈ I) : ∃! J, J ∈ π ∧ x ∈ J - BoxIntegral.Prepartition.biUnionIndex_of_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (hJ : J ∈ π) {J' : BoxIntegral.Box ι} (hJ' : J' ∈ πi J) : π.biUnionIndex πi J' = J - BoxIntegral.Prepartition.distortion_le_iff 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) [Fintype ι] {c : NNReal} : π.distortion ≤ c ↔ ∀ J ∈ π, J.distortion ≤ c - BoxIntegral.Prepartition.biUnion_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnion πi).boxes = π.boxes.biUnion fun J => (πi J).boxes - BoxIntegral.Prepartition.iUnion_def 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : π.iUnion = ⋃ J ∈ π, ↑J - BoxIntegral.Prepartition.mem_iUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {x : ι → ℝ} : x ∈ π.iUnion ↔ ∃ J ∈ π, x ∈ J - BoxIntegral.Prepartition.biUnion_assoc 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) (πi' : BoxIntegral.Box ι → (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnion fun J => (πi J).biUnion (πi' J)) = (π.biUnion πi).biUnion fun J => πi' (π.biUnionIndex πi J) J - BoxIntegral.Prepartition.eq_of_boxes_subset_iUnion_superset 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h₁ : π₁.boxes ⊆ π₂.boxes) (h₂ : π₂.iUnion ⊆ π₁.iUnion) : π₁ = π₂ - BoxIntegral.Prepartition.eq_of_le_of_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J J₁ J₂ : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (h₁ : J₁ ∈ π) (h₂ : J₂ ∈ π) (hle₁ : J ≤ J₁) (hle₂ : J ≤ J₂) : J₁ = J₂ - BoxIntegral.Prepartition.biUnion_le_iff 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} {π' : BoxIntegral.Prepartition I} : π.biUnion πi ≤ π' ↔ ∀ J ∈ π, πi J ≤ π'.restrict J - BoxIntegral.Prepartition.mem_biUnionIndex 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (hJ : J ∈ π.biUnion πi) : J ∈ πi (π.biUnionIndex πi J) - BoxIntegral.Prepartition.biUnion_congr_of_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} {πi₁ πi₂ : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (h : π₁ = π₂) (hi : ∀ J ≤ I, πi₁ J = πi₂ J) : π₁.biUnion πi₁ = π₂.biUnion πi₂ - BoxIntegral.Prepartition.le_def 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} : π₁ ≤ π₂ ↔ ∀ J ∈ π₁, ∃ J' ∈ π₂, J ≤ J' - BoxIntegral.Prepartition.eq_of_mem_of_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J₁ J₂ : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {x : ι → ℝ} (h₁ : J₁ ∈ π) (h₂ : J₂ ∈ π) (hx₁ : x ∈ J₁) (hx₂ : x ∈ J₂) : J₁ = J₂ - BoxIntegral.Prepartition.mem_biUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} : J ∈ π.biUnion πi ↔ ∃ J' ∈ π, J ∈ πi J' - BoxIntegral.Prepartition.biUnion_congr 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} {πi₁ πi₂ : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (h : π₁ = π₂) (hi : ∀ J ∈ π₁, πi₁ J = πi₂ J) : π₁.biUnion πi₁ = π₂.biUnion πi₂ - BoxIntegral.Prepartition.iUnion_biUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnion πi).iUnion = ⋃ J ∈ π, (πi J).iUnion - BoxIntegral.Prepartition.mem_restrict' 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J J₁ : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : J₁ ∈ π.restrict J ↔ ∃ J' ∈ π, ↑J₁ = ↑J ∩ ↑J' - BoxIntegral.Prepartition.le_biUnion_iff 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} {π' : BoxIntegral.Prepartition I} : π' ≤ π.biUnion πi ↔ π' ≤ π ∧ ∀ J ∈ π, π'.restrict J ≤ πi J - BoxIntegral.Prepartition.mem_restrict 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J J₁ : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : J₁ ∈ π.restrict J ↔ ∃ J' ∈ π, ↑J₁ = ↑J ⊓ ↑J' - BoxIntegral.Prepartition.iUnion_def' 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) : π.iUnion = ⋃ J ∈ π.boxes, ↑J - BoxIntegral.Prepartition.IsPartition.le_iff 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h : π₂.IsPartition) : π₁ ≤ π₂ ↔ ∀ J ∈ π₁, ∀ J' ∈ π₂, (↑J ∩ ↑J').Nonempty → J ≤ J' - BoxIntegral.Prepartition.disjUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π₁ π₂ : BoxIntegral.Prepartition I) (h : Disjoint π₁.iUnion π₂.iUnion) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.sum_fiberwise 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {α : Type u_2} {M : Type u_3} [AddCommMonoid M] (π : BoxIntegral.Prepartition I) (f : BoxIntegral.Box ι → α) (g : BoxIntegral.Box ι → M) : ∑ y ∈ Finset.image f π.boxes, ∑ J ∈ (π.filter fun J => f J = y).boxes, g J = ∑ J ∈ π.boxes, g J - BoxIntegral.Prepartition.sum_biUnion_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {M : Type u_2} [AddCommMonoid M] (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) (f : BoxIntegral.Box ι → M) : ∑ J ∈ π.boxes.biUnion fun J => (πi J).boxes, f J = ∑ J ∈ π.boxes, ∑ J' ∈ (πi J).boxes, f J' - BoxIntegral.Prepartition.le_iff_nonempty_imp_le_and_iUnion_subset 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} : π₁ ≤ π₂ ↔ (∀ J ∈ π₁, ∀ J' ∈ π₂, (↑J ∩ ↑J').Nonempty → J ≤ J') ∧ π₁.iUnion ⊆ π₂.iUnion - BoxIntegral.Prepartition.pairwiseDisjoint 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (self : BoxIntegral.Prepartition I) : (↑self.boxes).Pairwise (Function.onFun Disjoint BoxIntegral.Box.toSet) - BoxIntegral.Prepartition.injOn_setOfPred_mem_Icc_setOfPred_lower_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : 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} - BoxIntegral.Prepartition.injOn_setOf_mem_Icc_setOf_lower_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : 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} - BoxIntegral.Prepartition.disjoint_boxes_of_disjoint_iUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h : Disjoint π₁.iUnion π₂.iUnion) : Disjoint π₁.boxes π₂.boxes - BoxIntegral.Prepartition.mem_inf 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} : J ∈ π₁ ⊓ π₂ ↔ ∃ J₁ ∈ π₁, ∃ J₂ ∈ π₂, ↑J = ↑J₁ ⊓ ↑J₂ - BoxIntegral.Prepartition.ofWithBot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (boxes : Finset (WithBot (BoxIntegral.Box ι))) (le_of_mem : ∀ J ∈ boxes, J ≤ ↑I) (pairwise_disjoint : (↑boxes).Pairwise Disjoint) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.disjoint_coe_of_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J₁ J₂ : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (h₁ : J₁ ∈ π) (h₂ : J₂ ∈ π) (h : J₁ ≠ J₂) : Disjoint ↑J₁ ↑J₂ - BoxIntegral.Prepartition.iUnion_disjUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h : Disjoint π₁.iUnion π₂.iUnion) : (π₁.disjUnion π₂ h).iUnion = π₁.iUnion ∪ π₂.iUnion - BoxIntegral.Prepartition.distortion_disjUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} [Fintype ι] (h : Disjoint π₁.iUnion π₂.iUnion) : (π₁.disjUnion π₂ h).distortion = max π₁.distortion π₂.distortion - BoxIntegral.Prepartition.disjUnion_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π₁ π₂ : BoxIntegral.Prepartition I) (h : Disjoint π₁.iUnion π₂.iUnion) : (π₁.disjUnion π₂ h).boxes = π₁.boxes ∪ π₂.boxes - BoxIntegral.Prepartition.mk 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (boxes : Finset (BoxIntegral.Box ι)) (le_of_mem' : ∀ J ∈ boxes, J ≤ I) (pairwiseDisjoint : (↑boxes).Pairwise (Function.onFun Disjoint BoxIntegral.Box.toSet)) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.mem_disjUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (H : Disjoint π₁.iUnion π₂.iUnion) : J ∈ π₁.disjUnion π₂ H ↔ J ∈ π₁ ∨ J ∈ π₂ - BoxIntegral.Prepartition.card_filter_mem_Icc_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) [Fintype ι] (x : ι → ℝ) : {J ∈ π.boxes | x ∈ BoxIntegral.Box.Icc J}.card ≤ 2 ^ Fintype.card ι - BoxIntegral.Prepartition.mem_ofWithBot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} {boxes : Finset (WithBot (BoxIntegral.Box ι))} {h₁ : ∀ J ∈ boxes, J ≤ ↑I} {h₂ : (↑boxes).Pairwise Disjoint} : J ∈ BoxIntegral.Prepartition.ofWithBot boxes h₁ h₂ ↔ ↑J ∈ boxes - BoxIntegral.Prepartition.mem_mk 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I J : BoxIntegral.Box ι} {s : Finset (BoxIntegral.Box ι)} {h₁ : ∀ J ∈ s, J ≤ I} {h₂ : (↑s).Pairwise (Function.onFun Disjoint BoxIntegral.Box.toSet)} : J ∈ { boxes := s, le_of_mem' := h₁, pairwiseDisjoint := h₂ } ↔ J ∈ s - BoxIntegral.Prepartition.sum_disj_union_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} {M : Type u_2} [AddCommMonoid M] (h : Disjoint π₁.iUnion π₂.iUnion) (f : BoxIntegral.Box ι → M) : ∑ J ∈ π₁.boxes ∪ π₂.boxes, f J = ∑ J ∈ π₁.boxes, f J + ∑ J ∈ π₂.boxes, f J - BoxIntegral.Prepartition.le_ofWithBot 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {boxes : Finset (WithBot (BoxIntegral.Box ι))} {le_of_mem : ∀ J ∈ boxes, J ≤ ↑I} {pairwise_disjoint : (↑boxes).Pairwise Disjoint} (H : ∀ J ∈ π, ∃ J' ∈ boxes, ↑J ≤ J') : π ≤ BoxIntegral.Prepartition.ofWithBot boxes le_of_mem pairwise_disjoint - BoxIntegral.Prepartition.ofWithBot_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {boxes : Finset (WithBot (BoxIntegral.Box ι))} {le_of_mem : ∀ J ∈ boxes, J ≤ ↑I} {pairwise_disjoint : (↑boxes).Pairwise Disjoint} (H : ∀ J ∈ boxes, J ≠ ⊥ → ∃ J' ∈ π, J ≤ ↑J') : BoxIntegral.Prepartition.ofWithBot boxes le_of_mem pairwise_disjoint ≤ π - BoxIntegral.Prepartition.isPartitionDisjUnionOfEqDiff 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ π₂ : BoxIntegral.Prepartition I} (h : π₂.iUnion = ↑I \ π₁.iUnion) : (π₁.disjUnion π₂ ⋯).IsPartition - BoxIntegral.Prepartition.ofWithBot_mono 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {boxes₁ : Finset (WithBot (BoxIntegral.Box ι))} {le_of_mem₁ : ∀ J ∈ boxes₁, J ≤ ↑I} {pairwise_disjoint₁ : (↑boxes₁).Pairwise Disjoint} {boxes₂ : Finset (WithBot (BoxIntegral.Box ι))} {le_of_mem₂ : ∀ J ∈ boxes₂, J ≤ ↑I} {pairwise_disjoint₂ : (↑boxes₂).Pairwise Disjoint} (H : ∀ J ∈ boxes₁, J ≠ ⊥ → ∃ J' ∈ boxes₂, J ≤ J') : BoxIntegral.Prepartition.ofWithBot boxes₁ le_of_mem₁ pairwise_disjoint₁ ≤ BoxIntegral.Prepartition.ofWithBot boxes₂ le_of_mem₂ pairwise_disjoint₂ - BoxIntegral.TaggedPrepartition.toPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (self : BoxIntegral.TaggedPrepartition I) : BoxIntegral.Prepartition I - BoxIntegral.TaggedPrepartition.infPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.TaggedPrepartition I) (π' : BoxIntegral.Prepartition I) : BoxIntegral.TaggedPrepartition I - BoxIntegral.Prepartition.biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J) : BoxIntegral.TaggedPrepartition I - BoxIntegral.TaggedPrepartition.biUnionPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.TaggedPrepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : BoxIntegral.TaggedPrepartition I - BoxIntegral.TaggedPrepartition.IsPartition.infPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {π₁ : BoxIntegral.TaggedPrepartition I} (h₁ : π₁.IsPartition) {π₂ : BoxIntegral.Prepartition I} (h₂ : π₂.IsPartition) : (π₁.infPrepartition π₂).IsPartition - BoxIntegral.TaggedPrepartition.mem_toPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I J : BoxIntegral.Box ι} {π : BoxIntegral.TaggedPrepartition I} : J ∈ π.toPrepartition ↔ J ∈ π - BoxIntegral.TaggedPrepartition.infPrepartition_toPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.TaggedPrepartition I) (π' : BoxIntegral.Prepartition I) : (π.infPrepartition π').toPrepartition = π.toPrepartition ⊓ π' - BoxIntegral.TaggedPrepartition.isHenstock_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} {πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J} : (π.biUnionTagged πi).IsHenstock ↔ ∀ J ∈ π, (πi J).IsHenstock - BoxIntegral.TaggedPrepartition.biUnionPrepartition_tag 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.TaggedPrepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnionPrepartition πi).tag = fun J => π.tag (π.biUnionIndex πi J) - BoxIntegral.TaggedPrepartition.IsSubordinate.infPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.TaggedPrepartition I} {r : (ι → ℝ) → ↑(Set.Ioi 0)} [Fintype ι] (h : π.IsSubordinate r) (π' : BoxIntegral.Prepartition I) : (π.infPrepartition π').IsSubordinate r - BoxIntegral.Prepartition.IsPartition.biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} (h : π.IsPartition) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J} (hi : ∀ J ∈ π, (πi J).IsPartition) : (π.biUnionTagged πi).IsPartition - BoxIntegral.TaggedPrepartition.IsPartition.biUnionPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.TaggedPrepartition I} (h : π.IsPartition) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J} (hi : ∀ J ∈ π, (πi J).IsPartition) : (π.biUnionPrepartition πi).IsPartition - BoxIntegral.Prepartition.distortion_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} [Fintype ι] (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J) : (π.biUnionTagged πi).distortion = π.boxes.sup fun J => (πi J).distortion - BoxIntegral.TaggedPrepartition.IsSubordinate.biUnionPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {π : BoxIntegral.TaggedPrepartition I} {r : (ι → ℝ) → ↑(Set.Ioi 0)} [Fintype ι] (h : π.IsSubordinate r) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnionPrepartition πi).IsSubordinate r - BoxIntegral.TaggedPrepartition.distortion_biUnionPrepartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} [Fintype ι] (π : BoxIntegral.TaggedPrepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnionPrepartition πi).distortion = π.boxes.sup fun J => (πi J).distortion - BoxIntegral.Prepartition.tag_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J} (hJ : J ∈ π) {J' : BoxIntegral.Box ι} (hJ' : J' ∈ πi J) : (π.biUnionTagged πi).tag J' = (πi J).tag J' - BoxIntegral.TaggedPrepartition.isSubordinate_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} {r : (ι → ℝ) → ↑(Set.Ioi 0)} [Fintype ι] {π : BoxIntegral.Prepartition I} {πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J} : (π.biUnionTagged πi).IsSubordinate r ↔ ∀ J ∈ π, (πi J).IsSubordinate r - BoxIntegral.Prepartition.mem_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) {πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J} : J ∈ π.biUnionTagged πi ↔ ∃ J' ∈ π, J ∈ πi J' - BoxIntegral.TaggedPrepartition.mk 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (toPrepartition : BoxIntegral.Prepartition I) (tag : BoxIntegral.Box ι → ι → ℝ) (tag_mem_Icc : ∀ (J : BoxIntegral.Box ι), tag J ∈ BoxIntegral.Box.Icc I) : BoxIntegral.TaggedPrepartition I - BoxIntegral.Prepartition.iUnion_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J) : (π.biUnionTagged πi).iUnion = ⋃ J ∈ π, (πi J).iUnion - BoxIntegral.TaggedPrepartition.iUnion_mk 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (f : BoxIntegral.Box ι → ι → ℝ) (h : ∀ (J : BoxIntegral.Box ι), f J ∈ BoxIntegral.Box.Icc I) : { toPrepartition := π, tag := f, tag_mem_Icc := h }.iUnion = π.iUnion - BoxIntegral.Prepartition.forall_biUnionTagged 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I : BoxIntegral.Box ι} (p : (ι → ℝ) → BoxIntegral.Box ι → Prop) (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J) : (∀ J ∈ π.biUnionTagged πi, p ((π.biUnionTagged πi).tag J) J) ↔ ∀ J ∈ π, ∀ J' ∈ πi J, p ((πi J).tag J') J' - BoxIntegral.TaggedPrepartition.mem_mk 📋 Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ι : Type u_1} {I J : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (f : BoxIntegral.Box ι → ι → ℝ) (h : ∀ (J : BoxIntegral.Box ι), f J ∈ BoxIntegral.Box.Icc I) : J ∈ { toPrepartition := π, tag := f, tag_mem_Icc := h } ↔ J ∈ π - BoxIntegral.Prepartition.splitCenter 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] (I : BoxIntegral.Box ι) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.toSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : BoxIntegral.TaggedPrepartition I - BoxIntegral.Prepartition.isHenstock_toSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π.toSubordinate r).IsHenstock - BoxIntegral.Prepartition.isSubordinate_toSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π.toSubordinate r).IsSubordinate r - BoxIntegral.Prepartition.mem_splitCenter 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I J : BoxIntegral.Box ι} : J ∈ BoxIntegral.Prepartition.splitCenter I ↔ ∃ s, I.splitCenterBox s = J - BoxIntegral.Prepartition.distortion_toSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π.toSubordinate r).distortion = π.distortion - BoxIntegral.Prepartition.iUnion_toSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π.toSubordinate r).iUnion = π.iUnion - BoxIntegral.Prepartition.toSubordinate_toPrepartition_le 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π.toSubordinate r).toPrepartition ≤ π - BoxIntegral.TaggedPrepartition.unionComplToSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π₁ : BoxIntegral.TaggedPrepartition I) (π₂ : BoxIntegral.Prepartition I) (hU : π₂.iUnion = ↑I \ π₁.iUnion) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : BoxIntegral.TaggedPrepartition I - BoxIntegral.TaggedPrepartition.isPartition_unionComplToSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π₁ : BoxIntegral.TaggedPrepartition I) (π₂ : BoxIntegral.Prepartition I) (hU : π₂.iUnion = ↑I \ π₁.iUnion) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π₁.unionComplToSubordinate π₂ hU r).IsPartition - BoxIntegral.TaggedPrepartition.iUnion_unionComplToSubordinate_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π₁ : BoxIntegral.TaggedPrepartition I) (π₂ : BoxIntegral.Prepartition I) (hU : π₂.iUnion = ↑I \ π₁.iUnion) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π₁.unionComplToSubordinate π₂ hU r).iUnion = ↑I - BoxIntegral.TaggedPrepartition.distortion_unionComplToSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π₁ : BoxIntegral.TaggedPrepartition I) (π₂ : BoxIntegral.Prepartition I) (hU : π₂.iUnion = ↑I \ π₁.iUnion) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π₁.unionComplToSubordinate π₂ hU r).distortion = max π₁.distortion π₂.distortion - BoxIntegral.Prepartition.exists_tagged_le_isHenstock_isSubordinate_iUnion_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (r : (ι → ℝ) → ↑(Set.Ioi 0)) (π : BoxIntegral.Prepartition I) : ∃ π', π'.toPrepartition ≤ π ∧ π'.IsHenstock ∧ π'.IsSubordinate r ∧ π'.distortion = π.distortion ∧ π'.iUnion = π.iUnion - BoxIntegral.Prepartition.upper_sub_lower_of_mem_splitCenter 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I J : BoxIntegral.Box ι} (h : J ∈ BoxIntegral.Prepartition.splitCenter I) (i : ι) : J.upper i - J.lower i = (I.upper i - I.lower i) / 2 - BoxIntegral.TaggedPrepartition.unionComplToSubordinate_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} (π₁ : BoxIntegral.TaggedPrepartition I) (π₂ : BoxIntegral.Prepartition I) (hU : π₂.iUnion = ↑I \ π₁.iUnion) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : (π₁.unionComplToSubordinate π₂ hU r).boxes = π₁.boxes ∪ (π₂.toSubordinate r).boxes - BoxIntegral.Box.subbox_induction_on 📋 Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ι : Type u_1} [Fintype ι] {p : BoxIntegral.Box ι → Prop} (I : BoxIntegral.Box ι) (H_ind : ∀ J ≤ I, (∀ J' ∈ BoxIntegral.Prepartition.splitCenter J, p J') → p J) (H_nhds : ∀ z ∈ BoxIntegral.Box.Icc I, ∃ U ∈ nhdsWithin z (BoxIntegral.Box.Icc I), ∀ J ≤ I, ∀ (m : ℕ), z ∈ BoxIntegral.Box.Icc J → BoxIntegral.Box.Icc J ⊆ U → (∀ (i : ι), J.upper i - J.lower i = (I.upper i - I.lower i) / 2 ^ m) → p J) : p I - BoxIntegral.Prepartition.split 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} (I : BoxIntegral.Box ι) (i : ι) (x : ℝ) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.splitMany 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} (I : BoxIntegral.Box ι) (s : Finset (ι × ℝ)) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.compl 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] (π : BoxIntegral.Prepartition I) : BoxIntegral.Prepartition I - BoxIntegral.Prepartition.restrict_split 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I J : BoxIntegral.Box ι} (h : I ≤ J) (i : ι) (x : ℝ) : (BoxIntegral.Prepartition.split J i x).restrict I = BoxIntegral.Prepartition.split I i x - BoxIntegral.Prepartition.splitMany_empty 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} (I : BoxIntegral.Box ι) : BoxIntegral.Prepartition.splitMany I ∅ = ⊤ - BoxIntegral.Prepartition.IsPartition.exists_splitMany_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} [Finite ι] {I : BoxIntegral.Box ι} {π : BoxIntegral.Prepartition I} (h : π.IsPartition) : ∃ s, BoxIntegral.Prepartition.splitMany I s ≤ π - BoxIntegral.Prepartition.iUnion_compl 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] (π : BoxIntegral.Prepartition I) : π.compl.iUnion = ↑I \ π.iUnion - BoxIntegral.Prepartition.IsPartition.compl_eq_bot 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] {π : BoxIntegral.Prepartition I} (h : π.IsPartition) : π.compl = ⊥ - BoxIntegral.Prepartition.compl_congr 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] {π₁ π₂ : BoxIntegral.Prepartition I} (h : π₁.iUnion = π₂.iUnion) : π₁.compl = π₂.compl - BoxIntegral.Prepartition.exists_iUnion_eq_diff 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] (π : BoxIntegral.Prepartition I) : ∃ π', π'.iUnion = ↑I \ π.iUnion - BoxIntegral.Prepartition.exists_iUnion_eq_sdiff 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] (π : BoxIntegral.Prepartition I) : ∃ π', π'.iUnion = ↑I \ π.iUnion - BoxIntegral.Prepartition.inf_split 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (i : ι) (x : ℝ) : π ⊓ BoxIntegral.Prepartition.split I i x = π.biUnion fun J => BoxIntegral.Prepartition.split J i x - BoxIntegral.Prepartition.inf_splitMany 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (s : Finset (ι × ℝ)) : π ⊓ BoxIntegral.Prepartition.splitMany I s = π.biUnion fun J => BoxIntegral.Prepartition.splitMany J s - BoxIntegral.Prepartition.compl_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] : ⊤.compl = ⊥ - BoxIntegral.Prepartition.split_of_notMem_Ioo 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} {i : ι} {x : ℝ} (h : x ∉ Set.Ioo (I.lower i) (I.upper i)) : BoxIntegral.Prepartition.split I i x = ⊤ - BoxIntegral.Prepartition.mem_split_iff 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I J : BoxIntegral.Box ι} {i : ι} {x : ℝ} : J ∈ BoxIntegral.Prepartition.split I i x ↔ ↑J = I.splitLower i x ∨ ↑J = I.splitUpper i x - BoxIntegral.Prepartition.splitMany_le_split 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} (I : BoxIntegral.Box ι) {s : Finset (ι × ℝ)} {p : ι × ℝ} (hp : p ∈ s) : BoxIntegral.Prepartition.splitMany I s ≤ BoxIntegral.Prepartition.split I p.1 p.2 - BoxIntegral.Prepartition.coe_eq_of_mem_split_of_lt_mem 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I J : BoxIntegral.Box ι} {i : ι} {x : ℝ} {y : ι → ℝ} (h₁ : J ∈ BoxIntegral.Prepartition.split I i x) (h₂ : y ∈ J) (h₃ : x < y i) : ↑J = ↑I ∩ {y | x < y i} - BoxIntegral.Prepartition.coe_eq_of_mem_split_of_mem_le 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I J : BoxIntegral.Box ι} {i : ι} {x : ℝ} {y : ι → ℝ} (h₁ : J ∈ BoxIntegral.Prepartition.split I i x) (h₂ : y ∈ J) (h₃ : y i ≤ x) : ↑J = ↑I ∩ {y | y i ≤ x} - BoxIntegral.Prepartition.eventually_splitMany_inf_eq_filter 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] (π : BoxIntegral.Prepartition I) : ∀ᶠ (t : Finset (ι × ℝ)) in Filter.atTop, π ⊓ BoxIntegral.Prepartition.splitMany I t = (BoxIntegral.Prepartition.splitMany I t).filter fun J => ↑J ⊆ π.iUnion - BoxIntegral.Prepartition.splitMany_insert 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} (I : BoxIntegral.Box ι) (s : Finset (ι × ℝ)) (p : ι × ℝ) : BoxIntegral.Prepartition.splitMany I (insert p s) = BoxIntegral.Prepartition.splitMany I s ⊓ BoxIntegral.Prepartition.split I p.1 p.2 - BoxIntegral.Prepartition.mem_split_iff' 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I J : BoxIntegral.Box ι} {i : ι} {x : ℝ} : J ∈ BoxIntegral.Prepartition.split I i x ↔ ↑J = ↑I ∩ {y | y i ≤ x} ∨ ↑J = ↑I ∩ {y | x < y i} - BoxIntegral.Prepartition.exists_splitMany_inf_eq_filter_of_finite 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I : BoxIntegral.Box ι} [Finite ι] (s : Set (BoxIntegral.Prepartition I)) (hs : s.Finite) : ∃ t, ∀ π ∈ s, π ⊓ BoxIntegral.Prepartition.splitMany I t = (BoxIntegral.Prepartition.splitMany I t).filter fun J => ↑J ⊆ π.iUnion - BoxIntegral.Prepartition.eventually_not_disjoint_imp_le_of_mem_splitMany 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} [Finite ι] (s : Finset (BoxIntegral.Box ι)) : ∀ᶠ (t : Finset (ι × ℝ)) in Filter.atTop, ∀ (I J : BoxIntegral.Box ι), J ∈ s → ∀ J' ∈ BoxIntegral.Prepartition.splitMany I t, ¬Disjoint ↑J ↑J' → J' ≤ J - BoxIntegral.Prepartition.not_disjoint_imp_le_of_subset_of_mem_splitMany 📋 Mathlib.Analysis.BoxIntegral.Partition.Split
{ι : Type u_1} {I J Js : BoxIntegral.Box ι} {s : Finset (ι × ℝ)} (H : ∀ (i : ι), {(i, J.lower i), (i, J.upper i)} ⊆ s) (HJs : Js ∈ BoxIntegral.Prepartition.splitMany I s) (Hn : ¬Disjoint ↑J ↑Js) : Js ≤ J - BoxIntegral.IntegrationParams.toFilteriUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {l : BoxIntegral.IntegrationParams} (I : BoxIntegral.Box ι) (π₀ : BoxIntegral.Prepartition I) : Filter (BoxIntegral.TaggedPrepartition I) - BoxIntegral.IntegrationParams.toFilterDistortioniUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (c : NNReal) (π₀ : BoxIntegral.Prepartition I) : Filter (BoxIntegral.TaggedPrepartition I) - BoxIntegral.IntegrationParams.toFilteriUnion_neBot 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (π₀ : BoxIntegral.Prepartition I) : (BoxIntegral.IntegrationParams.toFilteriUnion I π₀).NeBot - BoxIntegral.IntegrationParams.eventually_isPartition 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) : ∀ᶠ (π : BoxIntegral.TaggedPrepartition I) in BoxIntegral.IntegrationParams.toFilteriUnion I ⊤, π.IsPartition - BoxIntegral.IntegrationParams.toFilterDistortioniUnion_neBot' 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (π₀ : BoxIntegral.Prepartition I) : (l.toFilterDistortioniUnion I (max π₀.distortion π₀.compl.distortion) π₀).NeBot - BoxIntegral.IntegrationParams.toFilteriUnion_congr 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (I : BoxIntegral.Box ι) (l : BoxIntegral.IntegrationParams) {π₁ π₂ : BoxIntegral.Prepartition I} (h : π₁.iUnion = π₂.iUnion) : BoxIntegral.IntegrationParams.toFilteriUnion I π₁ = BoxIntegral.IntegrationParams.toFilteriUnion I π₂ - BoxIntegral.IntegrationParams.toFilteriUnion_mono 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (I : BoxIntegral.Box ι) {l₁ l₂ : BoxIntegral.IntegrationParams} (h : l₁ ≤ l₂) (π₀ : BoxIntegral.Prepartition I) : BoxIntegral.IntegrationParams.toFilteriUnion I π₀ ≤ BoxIntegral.IntegrationParams.toFilteriUnion I π₀ - BoxIntegral.IntegrationParams.toFilterDistortioniUnion_neBot 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {c : NNReal} (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (π₀ : BoxIntegral.Prepartition I) (hc₁ : π₀.distortion ≤ c) (hc₂ : π₀.compl.distortion ≤ c) : (l.toFilterDistortioniUnion I c π₀).NeBot - BoxIntegral.IntegrationParams.toFilter_inf_iUnion_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (π₀ : BoxIntegral.Prepartition I) : l.toFilter I ⊓ Filter.principal {π | π.iUnion = π₀.iUnion} = BoxIntegral.IntegrationParams.toFilteriUnion I π₀ - BoxIntegral.IntegrationParams.hasBasis_toFilterDistortioniUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (c : NNReal) (π₀ : BoxIntegral.Prepartition I) : (l.toFilterDistortioniUnion I c π₀).HasBasis l.RCond fun r => {π | l.MemBaseSet I c r π ∧ π.iUnion = π₀.iUnion} - BoxIntegral.IntegrationParams.MemBaseSet.exists_compl 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {l : BoxIntegral.IntegrationParams} {I : BoxIntegral.Box ι} {c : NNReal} {r : (ι → ℝ) → ↑(Set.Ioi 0)} {π : BoxIntegral.TaggedPrepartition I} (self : l.MemBaseSet I c r π) : l.bDistortion = true → ∃ π', π'.iUnion = ↑I \ π.iUnion ∧ π'.distortion ≤ c - BoxIntegral.IntegrationParams.tendsto_embedBox_toFilteriUnion_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {I J : BoxIntegral.Box ι} (l : BoxIntegral.IntegrationParams) (h : I ≤ J) : Filter.Tendsto (⇑(BoxIntegral.TaggedPrepartition.embedBox I J h)) (BoxIntegral.IntegrationParams.toFilteriUnion I ⊤) (BoxIntegral.IntegrationParams.toFilteriUnion J (BoxIntegral.Prepartition.single J I h)) - BoxIntegral.IntegrationParams.exists_memBaseSet_le_iUnion_eq 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} {c : NNReal} (l : BoxIntegral.IntegrationParams) (π₀ : BoxIntegral.Prepartition I) (hc₁ : π₀.distortion ≤ c) (hc₂ : π₀.compl.distortion ≤ c) (r : (ι → ℝ) → ↑(Set.Ioi 0)) : ∃ π, l.MemBaseSet I c r π ∧ π.toPrepartition ≤ π₀ ∧ π.iUnion = π₀.iUnion - BoxIntegral.IntegrationParams.hasBasis_toFilteriUnion 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) (π₀ : BoxIntegral.Prepartition I) : (BoxIntegral.IntegrationParams.toFilteriUnion I π₀).HasBasis (fun r => ∀ (c : NNReal), l.RCond (r c)) fun r => {π | ∃ c, l.MemBaseSet I c (r c) π ∧ π.iUnion = π₀.iUnion} - BoxIntegral.IntegrationParams.hasBasis_toFilteriUnion_top 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] (l : BoxIntegral.IntegrationParams) (I : BoxIntegral.Box ι) : (BoxIntegral.IntegrationParams.toFilteriUnion I ⊤).HasBasis (fun r => ∀ (c : NNReal), l.RCond (r c)) fun r => {π | ∃ c, l.MemBaseSet I c (r c) π ∧ π.IsPartition} - BoxIntegral.IntegrationParams.biUnionTagged_memBaseSet 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} {c : NNReal} {l : BoxIntegral.IntegrationParams} {r : (ι → ℝ) → ↑(Set.Ioi 0)} {π : BoxIntegral.Prepartition I} {πi : (J : BoxIntegral.Box ι) → BoxIntegral.TaggedPrepartition J} (h : ∀ J ∈ π, l.MemBaseSet J c r (πi J)) (hp : ∀ J ∈ π, (πi J).IsPartition) (hc : l.bDistortion = true → π.compl.distortion ≤ c) : l.MemBaseSet I c r (π.biUnionTagged πi) - BoxIntegral.IntegrationParams.MemBaseSet.mk 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {l : BoxIntegral.IntegrationParams} {I : BoxIntegral.Box ι} {c : NNReal} {r : (ι → ℝ) → ↑(Set.Ioi 0)} {π : BoxIntegral.TaggedPrepartition I} (isSubordinate : π.IsSubordinate r) (isHenstock : l.bHenstock = true → π.IsHenstock) (distortion_le : l.bDistortion = true → π.distortion ≤ c) (exists_compl : l.bDistortion = true → ∃ π', π'.iUnion = ↑I \ π.iUnion ∧ π'.distortion ≤ c) : l.MemBaseSet I c r π - BoxIntegral.IntegrationParams.MemBaseSet.exists_common_compl 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} {c₁ c₂ : NNReal} {l : BoxIntegral.IntegrationParams} {r₁ r₂ : (ι → ℝ) → ↑(Set.Ioi 0)} {π₁ π₂ : BoxIntegral.TaggedPrepartition I} (h₁ : l.MemBaseSet I c₁ r₁ π₁) (h₂ : l.MemBaseSet I c₂ r₂ π₂) (hU : π₁.iUnion = π₂.iUnion) : ∃ π, π.iUnion = ↑I \ π₁.iUnion ∧ (l.bDistortion = true → π.distortion ≤ c₁) ∧ (l.bDistortion = true → π.distortion ≤ c₂) - BoxIntegral.IntegrationParams.MemBaseSet.unionComplToSubordinate 📋 Mathlib.Analysis.BoxIntegral.Partition.Filter
{ι : Type u_1} [Fintype ι] {I : BoxIntegral.Box ι} {c : NNReal} {l : BoxIntegral.IntegrationParams} {r₁ r₂ : (ι → ℝ) → ↑(Set.Ioi 0)} {π₁ : BoxIntegral.TaggedPrepartition I} (hπ₁ : l.MemBaseSet I c r₁ π₁) (hle : ∀ x ∈ BoxIntegral.Box.Icc I, r₂ x ≤ r₁ x) {π₂ : BoxIntegral.Prepartition I} (hU : π₂.iUnion = ↑I \ π₁.iUnion) (hc : l.bDistortion = true → π₂.distortion ≤ c) : l.MemBaseSet I c r₁ (π₁.unionComplToSubordinate π₂ hU r₂)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59