Theorems · Theorem · order theory

Finset.disjSups_disjSups_disjSups_comm

∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : DistribLattice α] [inst_2 : OrderBot α]
  [inst_3 : DecidableRel Disjoint] (s t u v : Finset α),
  (s.disjSups t).disjSups (u.disjSups v) = (s.disjSups u).disjSups (t.disjSups v)

Defined in: Mathlib.Data.Finset.Sups
Cited by: 0 results in Mathlib
Foundations: Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: DecidableEq DistribLattice OrderBot DecidableRel

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Finsetstatement and proof · cited by 13,712
Disjointstatement and proof · cited by 2,201
OrderBotstatement and proof · cited by 1,055
DistribLatticestatement and proof · cited by 150
Finset.disjSupsstatement and proof · cited by 22
Finset.disjSups_right_commproof · cited by 1

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.