Theorems · Theorem · order theory
disjoint_memPartition
∀ {α : Type u_1} (f : ℕ → Set α) (n : ℕ) {u v : Set α},
u ∈ memPartition f n → v ∈ memPartition f n → u ≠ v → Disjoint u v- Defined in
- Mathlib.Data.Set.MemPartition
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 60 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.
- Setstatement and proof · cited by 53,352
- Set.univproof · cited by 3,945
- Disjointstatement and proof · cited by 2,201
- Set.inter_subset_leftproof · cited by 360
- Set.inter_subset_rightproof · cited by 329
- Set.sdiff_subsetproof · cited by 156
- Disjoint.monoproof · cited by 69
- Disjoint.mono_rightproof · cited by 64
- Disjoint.mono_leftproof · cited by 50
- Set.disjoint_sdiff_leftproof · cited by 25
- Set.disjoint_sdiff_rightproof · cited by 23
- memPartitionstatement and proof · cited by 20
Cited by3
Results whose statement or proof uses this declaration.
- memPartitionSet_eq_iffproof · cited by 3
- MeasurableSpace.disjoint_countablePartitionproof · cited by 2
- MeasurableSpace.measurableSet_generateFrom_memPartition_iffproof · cited by 1