/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import Mathlib.Algebra.Ring.Nat public import Mathlib.Data.Finset.Prod

Counting strictly ordered pairs in a finset

@[expose] public sectionnamespace Finset

Twice the number of pairs (a, b) ∈ A ×ˢ A with a < b is |A| * (|A| - 1).

All goals completed! 🐙

Twice the number of pairs (a, b) ∈ A ×ˢ A with b < a is |A| * (|A| - 1).

β:Type u_1inst✝:LinearOrder βA:Finset β⊢ 2 * #({p ∈ A ×ˢ A | p.2 < p.1}) = 2 * #({p ∈ A ×ˢ A | p.1 < p.2}) β:Type u_1inst✝:LinearOrder βA:Finset β⊢ #({p ∈ A ×ˢ A | p.2 < p.1}) = #({p ∈ A ×ˢ A | p.1 < p.2}) exact card_equiv (.prodComm ..) (β:Type u_1inst✝:LinearOrder βA:Finset β⊢ ∀ (i : β × β), i ∈ {p ∈ A ×ˢ A | p.2 < p.1} ↔ (Equiv.prodComm β β) i ∈ {p ∈ A ×ˢ A | p.1 < p.2} All goals completed! 🐙)end Finset