Theorems · Theorem · order theory

Finset.swap_mem_antidiagonal

∀ {α : Type u_1} [inst : AddCommMonoid α] [inst_1 : PartialOrder α] [inst_2 : IsOrderedCancelAddMonoid α] {s t : Set α}
  {hs : s.IsPWO} {ht : t.IsPWO} {a : α} {x : α × α},
  x.swap ∈ Finset.antidiagonal hs ht a ↔ x ∈ Finset.antidiagonal ht hs a

Defined in

Mathlib.Data.Finset.MulAntidiagonal

Cited by

1 results in Mathlib

Foundations

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

Assumes

AddCommMonoidPartialOrderIsOrderedCancelAddMonoid