Theorems · Theorem · combinatorics

Set.sep_infs_le

∀ {α : Type u_2} [inst : SemilatticeInf α] (s t : Set α) (a : α),
  {b | b ∈ s ⊼ t ∧ a ≤ b} = {b | b ∈ s ∧ a ≤ b} ⊼ {b | b ∈ t ∧ a ≤ b}

Defined in

Mathlib.Data.Set.Sups

Cited by

1 results in Mathlib

Foundations

Depth 9 from the axioms · uses propext, Quot.sound

Assumes

SemilatticeInf