Theorems · Theorem · logic and foundations

Set.PairwiseDisjoint.insert

∀ {α : Type u_1} {ι : Type u_4} [inst : PartialOrder α] [inst_1 : OrderBot α] {s : Set ι} {f : ι → α},
  s.PairwiseDisjoint f → ∀ {i : ι}, (∀ j ∈ s, i ≠ j → Disjoint (f i) (f j)) → (insert i s).PairwiseDisjoint f

Defined in

Mathlib.Data.Set.Pairwise.Basic

Cited by

3 results in Mathlib

Foundations

Depth 22 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

PartialOrderOrderBot