data.fintype.sort | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

509de852

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

327c3c0d

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
 -/
-import Mathbin.Data.Finset.Sort
-import Mathbin.Data.Fintype.Basic
+import Data.Finset.Sort
+import Data.Fintype.Basic
 
 #align_import data.fintype.sort from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"

327c3c0d

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
-
-! This file was ported from Lean 3 source module data.fintype.sort
-! leanprover-community/mathlib commit 327c3c0d9232d80e250dc8f65e7835b82b266ea5
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Finset.Sort
 import Mathbin.Data.Fintype.Basic
 
+#align_import data.fintype.sort from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"
+
 /-!
 # Sorting a finite type

327c3c0d

bump to nightly-2023-06-09-07

mathlib commit https://github.com/leanprover-community/mathlib/commit/7e5137f579de09a059a5ce98f364a04e221aabf0

16afdc39

Diff

@@ -50,7 +50,6 @@ def finSumEquivOfFinset (hm : s.card = m) (hn : sᶜ.card = n) : Sum (Fin m) (Fi
       Equiv.sumCongr (s.orderIsoOfFin hm).toEquiv <|
         (sᶜ.orderIsoOfFin hn).toEquiv.trans <| Equiv.Set.ofEq s.coe_compl
     _ ≃ α := Equiv.Set.sumCompl _
-    
 #align fin_sum_equiv_of_finset finSumEquivOfFinset
 -/

327c3c0d

bump to nightly-2023-05-28-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

8d353152

Diff

@@ -26,6 +26,7 @@ This file provides two equivalences for linearly ordered fintypes:
 
 open Finset
 
+#print monoEquivOfFin /-
 /-- Given a linearly ordered fintype `α` of cardinal `k`, the order isomorphism
 `mono_equiv_of_fin α h` is the increasing bijection between `fin k` and `α`. Here, `h` is a proof
 that the cardinality of `α` is `k`. We use this instead of an isomorphism `fin (card α) ≃o α` to
@@ -34,6 +35,7 @@ def monoEquivOfFin (α : Type _) [Fintype α] [LinearOrder α] {k : ℕ} (h : Fi
     Fin k ≃o α :=
   (univ.orderIsoOfFin h).trans <| (OrderIso.setCongr _ _ coe_univ).trans OrderIso.Set.univ
 #align mono_equiv_of_fin monoEquivOfFin
+-/
 
 variable {α : Type _} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α}

327c3c0d

bump to nightly-2023-05-28-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

ba5d8b97

Diff

@@ -26,12 +26,6 @@ This file provides two equivalences for linearly ordered fintypes:
 
 open Finset
 
-/- warning: mono_equiv_of_fin -> monoEquivOfFin is a dubious translation:
-lean 3 declaration is
-  forall (α : Type.{u1}) [_inst_1 : Fintype.{u1} α] [_inst_2 : LinearOrder.{u1} α] {k : Nat}, (Eq.{1} Nat (Fintype.card.{u1} α _inst_1) k) -> (OrderIso.{0, u1} (Fin k) α (Fin.hasLe k) (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))))
-but is expected to have type
-  forall (α : Type.{u1}) [_inst_1 : Fintype.{u1} α] [_inst_2 : LinearOrder.{u1} α] {k : Nat}, (Eq.{1} Nat (Fintype.card.{u1} α _inst_1) k) -> (OrderIso.{0, u1} (Fin k) α (instLEFin k) (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (DistribLattice.toLattice.{u1} α (instDistribLattice.{u1} α _inst_2)))))))
-Case conversion may be inaccurate. Consider using '#align mono_equiv_of_fin monoEquivOfFinₓ'. -/
 /-- Given a linearly ordered fintype `α` of cardinal `k`, the order isomorphism
 `mono_equiv_of_fin α h` is the increasing bijection between `fin k` and `α`. Here, `h` is a proof
 that the cardinality of `α` is `k`. We use this instead of an isomorphism `fin (card α) ≃o α` to

327c3c0d

bump to nightly-2023-05-16-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/0b9eaaa7686280fad8cce467f5c3c57ee6ce77f8

9cb92e8c

Diff

@@ -26,7 +26,12 @@ This file provides two equivalences for linearly ordered fintypes:
 
 open Finset
 
-#print monoEquivOfFin /-
+/- warning: mono_equiv_of_fin -> monoEquivOfFin is a dubious translation:
+lean 3 declaration is
+  forall (α : Type.{u1}) [_inst_1 : Fintype.{u1} α] [_inst_2 : LinearOrder.{u1} α] {k : Nat}, (Eq.{1} Nat (Fintype.card.{u1} α _inst_1) k) -> (OrderIso.{0, u1} (Fin k) α (Fin.hasLe k) (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_2))))))
+but is expected to have type
+  forall (α : Type.{u1}) [_inst_1 : Fintype.{u1} α] [_inst_2 : LinearOrder.{u1} α] {k : Nat}, (Eq.{1} Nat (Fintype.card.{u1} α _inst_1) k) -> (OrderIso.{0, u1} (Fin k) α (instLEFin k) (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (DistribLattice.toLattice.{u1} α (instDistribLattice.{u1} α _inst_2)))))))
+Case conversion may be inaccurate. Consider using '#align mono_equiv_of_fin monoEquivOfFinₓ'. -/
 /-- Given a linearly ordered fintype `α` of cardinal `k`, the order isomorphism
 `mono_equiv_of_fin α h` is the increasing bijection between `fin k` and `α`. Here, `h` is a proof
 that the cardinality of `α` is `k`. We use this instead of an isomorphism `fin (card α) ≃o α` to
@@ -35,7 +40,6 @@ def monoEquivOfFin (α : Type _) [Fintype α] [LinearOrder α] {k : ℕ} (h : Fi
     Fin k ≃o α :=
   (univ.orderIsoOfFin h).trans <| (OrderIso.setCongr _ _ coe_univ).trans OrderIso.Set.univ
 #align mono_equiv_of_fin monoEquivOfFin
--/
 
 variable {α : Type _} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α}

327c3c0d

bump to nightly-2023-03-11-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/3180fab693e2cee3bff62675571264cb8778b212

1d00e3b6

Diff

@@ -39,12 +39,7 @@ def monoEquivOfFin (α : Type _) [Fintype α] [LinearOrder α] {k : ℕ} (h : Fi
 
 variable {α : Type _} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α}
 
-/- warning: fin_sum_equiv_of_finset -> finSumEquivOfFinset is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : DecidableEq.{succ u1} α] [_inst_2 : Fintype.{u1} α] [_inst_3 : LinearOrder.{u1} α] {m : Nat} {n : Nat} {s : Finset.{u1} α}, (Eq.{1} Nat (Finset.card.{u1} α s) m) -> (Eq.{1} Nat (Finset.card.{u1} α (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.booleanAlgebra.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s)) n) -> (Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : DecidableEq.{succ u1} α] [_inst_2 : Fintype.{u1} α] [_inst_3 : LinearOrder.{u1} α] {m : Nat} {n : Nat} {s : Finset.{u1} α}, (Eq.{1} Nat (Finset.card.{u1} α s) m) -> (Eq.{1} Nat (Finset.card.{u1} α (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.instBooleanAlgebraFinset.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s)) n) -> (Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α)
-Case conversion may be inaccurate. Consider using '#align fin_sum_equiv_of_finset finSumEquivOfFinsetₓ'. -/
+#print finSumEquivOfFinset /-
 /-- If `α` is a linearly ordered fintype, `s : finset α` has cardinality `m` and its complement has
 cardinality `n`, then `fin m ⊕ fin n ≃ α`. The equivalence sends elements of `fin m` to
 elements of `s` and elements of `fin n` to elements of `sᶜ` while preserving order on each
@@ -57,28 +52,21 @@ def finSumEquivOfFinset (hm : s.card = m) (hn : sᶜ.card = n) : Sum (Fin m) (Fi
     _ ≃ α := Equiv.Set.sumCompl _
     
 #align fin_sum_equiv_of_finset finSumEquivOfFinset
+-/
 
-/- warning: fin_sum_equiv_of_finset_inl -> finSumEquivOfFinset_inl is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : DecidableEq.{succ u1} α] [_inst_2 : Fintype.{u1} α] [_inst_3 : LinearOrder.{u1} α] {m : Nat} {n : Nat} {s : Finset.{u1} α} (hm : Eq.{1} Nat (Finset.card.{u1} α s) m) (hn : Eq.{1} Nat (Finset.card.{u1} α (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.booleanAlgebra.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s)) n) (i : Fin m), Eq.{succ u1} α (coeFn.{succ u1, succ u1} (Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (fun (_x : Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) => (Sum.{0, 0} (Fin m) (Fin n)) -> α) (Equiv.hasCoeToFun.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (finSumEquivOfFinset.{u1} α (fun (a : α) (b : α) => _inst_1 a b) _inst_2 _inst_3 m n s hm hn) (Sum.inl.{0, 0} (Fin m) (Fin n) i)) (coeFn.{succ u1, succ u1} (OrderEmbedding.{0, u1} (Fin m) α (Fin.hasLe m) (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_3)))))) (fun (_x : RelEmbedding.{0, u1} (Fin m) α (LE.le.{0} (Fin m) (Fin.hasLe m)) (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_3))))))) => (Fin m) -> α) (RelEmbedding.hasCoeToFun.{0, u1} (Fin m) α (LE.le.{0} (Fin m) (Fin.hasLe m)) (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_3))))))) (Finset.orderEmbOfFin.{u1} α _inst_3 s m hm) i)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : DecidableEq.{succ u1} α] [_inst_2 : Fintype.{u1} α] [_inst_3 : LinearOrder.{u1} α] {m : Nat} {n : Nat} {s : Finset.{u1} α} (hm : Eq.{1} Nat (Finset.card.{u1} α s) m) (hn : Eq.{1} Nat (Finset.card.{u1} α (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.instBooleanAlgebraFinset.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s)) n) (i : Fin m), Eq.{succ u1} ((fun (x._@.Mathlib.Logic.Equiv.Defs._hyg.805 : Sum.{0, 0} (Fin m) (Fin n)) => α) (Sum.inl.{0, 0} (Fin m) (Fin n) i)) (FunLike.coe.{succ u1, 1, succ u1} (Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (Sum.{0, 0} (Fin m) (Fin n)) (fun (_x : Sum.{0, 0} (Fin m) (Fin n)) => (fun (x._@.Mathlib.Logic.Equiv.Defs._hyg.805 : Sum.{0, 0} (Fin m) (Fin n)) => α) _x) (Equiv.instFunLikeEquiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (finSumEquivOfFinset.{u1} α (fun (a : α) (b : α) => _inst_1 a b) _inst_2 _inst_3 m n s hm hn) (Sum.inl.{0, 0} (Fin m) (Fin n) i)) (FunLike.coe.{succ u1, 1, succ u1} (Function.Embedding.{1, succ u1} (Fin m) α) (Fin m) (fun (_x : Fin m) => (fun (x._@.Mathlib.Data.FunLike.Embedding._hyg.19 : Fin m) => α) _x) (EmbeddingLike.toFunLike.{succ u1, 1, succ u1} (Function.Embedding.{1, succ u1} (Fin m) α) (Fin m) α (Function.instEmbeddingLikeEmbedding.{1, succ u1} (Fin m) α)) (RelEmbedding.toEmbedding.{0, u1} (Fin m) α (fun (x._@.Mathlib.Order.Hom.Basic._hyg.680 : Fin m) (x._@.Mathlib.Order.Hom.Basic._hyg.682 : Fin m) => LE.le.{0} (Fin m) (instLEFin m) x._@.Mathlib.Order.Hom.Basic._hyg.680 x._@.Mathlib.Order.Hom.Basic._hyg.682) (fun (x._@.Mathlib.Order.Hom.Basic._hyg.695 : α) (x._@.Mathlib.Order.Hom.Basic._hyg.697 : α) => LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (DistribLattice.toLattice.{u1} α (instDistribLattice.{u1} α _inst_3)))))) x._@.Mathlib.Order.Hom.Basic._hyg.695 x._@.Mathlib.Order.Hom.Basic._hyg.697) (Finset.orderEmbOfFin.{u1} α _inst_3 s m hm)) i)
-Case conversion may be inaccurate. Consider using '#align fin_sum_equiv_of_finset_inl finSumEquivOfFinset_inlₓ'. -/
+#print finSumEquivOfFinset_inl /-
 @[simp]
 theorem finSumEquivOfFinset_inl (hm : s.card = m) (hn : sᶜ.card = n) (i : Fin m) :
     finSumEquivOfFinset hm hn (Sum.inl i) = s.orderEmbOfFin hm i :=
   rfl
 #align fin_sum_equiv_of_finset_inl finSumEquivOfFinset_inl
+-/
 
-/- warning: fin_sum_equiv_of_finset_inr -> finSumEquivOfFinset_inr is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : DecidableEq.{succ u1} α] [_inst_2 : Fintype.{u1} α] [_inst_3 : LinearOrder.{u1} α] {m : Nat} {n : Nat} {s : Finset.{u1} α} (hm : Eq.{1} Nat (Finset.card.{u1} α s) m) (hn : Eq.{1} Nat (Finset.card.{u1} α (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.booleanAlgebra.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s)) n) (i : Fin n), Eq.{succ u1} α (coeFn.{succ u1, succ u1} (Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (fun (_x : Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) => (Sum.{0, 0} (Fin m) (Fin n)) -> α) (Equiv.hasCoeToFun.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (finSumEquivOfFinset.{u1} α (fun (a : α) (b : α) => _inst_1 a b) _inst_2 _inst_3 m n s hm hn) (Sum.inr.{0, 0} (Fin m) (Fin n) i)) (coeFn.{succ u1, succ u1} (OrderEmbedding.{0, u1} (Fin n) α (Fin.hasLe n) (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_3)))))) (fun (_x : RelEmbedding.{0, u1} (Fin n) α (LE.le.{0} (Fin n) (Fin.hasLe n)) (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_3))))))) => (Fin n) -> α) (RelEmbedding.hasCoeToFun.{0, u1} (Fin n) α (LE.le.{0} (Fin n) (Fin.hasLe n)) (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (LinearOrder.toLattice.{u1} α _inst_3))))))) (Finset.orderEmbOfFin.{u1} α _inst_3 (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.booleanAlgebra.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s) n hn) i)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : DecidableEq.{succ u1} α] [_inst_2 : Fintype.{u1} α] [_inst_3 : LinearOrder.{u1} α] {m : Nat} {n : Nat} {s : Finset.{u1} α} (hm : Eq.{1} Nat (Finset.card.{u1} α s) m) (hn : Eq.{1} Nat (Finset.card.{u1} α (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.instBooleanAlgebraFinset.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s)) n) (i : Fin n), Eq.{succ u1} ((fun (x._@.Mathlib.Logic.Equiv.Defs._hyg.805 : Sum.{0, 0} (Fin m) (Fin n)) => α) (Sum.inr.{0, 0} (Fin m) (Fin n) i)) (FunLike.coe.{succ u1, 1, succ u1} (Equiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (Sum.{0, 0} (Fin m) (Fin n)) (fun (_x : Sum.{0, 0} (Fin m) (Fin n)) => (fun (x._@.Mathlib.Logic.Equiv.Defs._hyg.805 : Sum.{0, 0} (Fin m) (Fin n)) => α) _x) (Equiv.instFunLikeEquiv.{1, succ u1} (Sum.{0, 0} (Fin m) (Fin n)) α) (finSumEquivOfFinset.{u1} α (fun (a : α) (b : α) => _inst_1 a b) _inst_2 _inst_3 m n s hm hn) (Sum.inr.{0, 0} (Fin m) (Fin n) i)) (FunLike.coe.{succ u1, 1, succ u1} (Function.Embedding.{1, succ u1} (Fin n) α) (Fin n) (fun (_x : Fin n) => (fun (x._@.Mathlib.Data.FunLike.Embedding._hyg.19 : Fin n) => α) _x) (EmbeddingLike.toFunLike.{succ u1, 1, succ u1} (Function.Embedding.{1, succ u1} (Fin n) α) (Fin n) α (Function.instEmbeddingLikeEmbedding.{1, succ u1} (Fin n) α)) (RelEmbedding.toEmbedding.{0, u1} (Fin n) α (fun (x._@.Mathlib.Order.Hom.Basic._hyg.680 : Fin n) (x._@.Mathlib.Order.Hom.Basic._hyg.682 : Fin n) => LE.le.{0} (Fin n) (instLEFin n) x._@.Mathlib.Order.Hom.Basic._hyg.680 x._@.Mathlib.Order.Hom.Basic._hyg.682) (fun (x._@.Mathlib.Order.Hom.Basic._hyg.695 : α) (x._@.Mathlib.Order.Hom.Basic._hyg.697 : α) => LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α (SemilatticeInf.toPartialOrder.{u1} α (Lattice.toSemilatticeInf.{u1} α (DistribLattice.toLattice.{u1} α (instDistribLattice.{u1} α _inst_3)))))) x._@.Mathlib.Order.Hom.Basic._hyg.695 x._@.Mathlib.Order.Hom.Basic._hyg.697) (Finset.orderEmbOfFin.{u1} α _inst_3 (HasCompl.compl.{u1} (Finset.{u1} α) (BooleanAlgebra.toHasCompl.{u1} (Finset.{u1} α) (Finset.instBooleanAlgebraFinset.{u1} α _inst_2 (fun (a : α) (b : α) => _inst_1 a b))) s) n hn)) i)
-Case conversion may be inaccurate. Consider using '#align fin_sum_equiv_of_finset_inr finSumEquivOfFinset_inrₓ'. -/
+#print finSumEquivOfFinset_inr /-
 @[simp]
 theorem finSumEquivOfFinset_inr (hm : s.card = m) (hn : sᶜ.card = n) (i : Fin n) :
     finSumEquivOfFinset hm hn (Sum.inr i) = sᶜ.orderEmbOfFin hn i :=
   rfl
 #align fin_sum_equiv_of_finset_inr finSumEquivOfFinset_inr
+-/

327c3c0d

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

509de852

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -24,12 +24,12 @@ open Finset
 `monoEquivOfFin α h` is the increasing bijection between `Fin k` and `α`. Here, `h` is a proof
 that the cardinality of `α` is `k`. We use this instead of an isomorphism `Fin (card α) ≃o α` to
 avoid casting issues in further uses of this function. -/
-def monoEquivOfFin (α : Type _) [Fintype α] [LinearOrder α] {k : ℕ} (h : Fintype.card α = k) :
+def monoEquivOfFin (α : Type*) [Fintype α] [LinearOrder α] {k : ℕ} (h : Fintype.card α = k) :
     Fin k ≃o α :=
   (univ.orderIsoOfFin h).trans <| (OrderIso.setCongr _ _ coe_univ).trans OrderIso.Set.univ
 #align mono_equiv_of_fin monoEquivOfFin
 
-variable {α : Type _} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α}
+variable {α : Type*} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α}
 
 /-- If `α` is a linearly ordered fintype, `s : Finset α` has cardinality `m` and its complement has
 cardinality `n`, then `Fin m ⊕ Fin n ≃ α`. The equivalence sends elements of `Fin m` to

509de852

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2017 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
-
-! This file was ported from Lean 3 source module data.fintype.sort
-! leanprover-community/mathlib commit 509de852e1de55e1efa8eacfa11df0823f26f226
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Finset.Sort
 import Mathlib.Data.Fintype.Basic
 
+#align_import data.fintype.sort from "leanprover-community/mathlib"@"509de852e1de55e1efa8eacfa11df0823f26f226"
+
 /-!
 # Sorting a finite type

509de852

chore: fix backtick in docs (#5077)

I wrote a script to find lines that contain an odd number of backticks

878d95c4

Diff

@@ -35,7 +35,7 @@ def monoEquivOfFin (α : Type _) [Fintype α] [LinearOrder α] {k : ℕ} (h : Fi
 variable {α : Type _} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α}
 
 /-- If `α` is a linearly ordered fintype, `s : Finset α` has cardinality `m` and its complement has
-cardinality `n`, then `Fin m ⊕ Fin n ≃ α`. The equivalence sends elements of Fin m` to
+cardinality `n`, then `Fin m ⊕ Fin n ≃ α`. The equivalence sends elements of `Fin m` to
 elements of `s` and elements of `Fin n` to elements of `sᶜ` while preserving order on each
 "half" of `Fin m ⊕ Fin n` (using `Set.orderIsoOfFin`). -/
 def finSumEquivOfFinset (hm : s.card = m) (hn : sᶜ.card = n) : Sum (Fin m) (Fin n) ≃ α :=

509de852

chore: fix #align lines (#3640)

This PR fixes two things:

Most align statements for definitions and theorems and instances that are separated by two newlines from the relevant declaration (s/\n\n#align/\n#align). This is often seen in the mathport output after ending calc blocks.
All remaining more-than-one-line #align statements. (This was needed for a script I wrote for #3630.)

2b42dc7c

Diff

@@ -44,7 +44,6 @@ def finSumEquivOfFinset (hm : s.card = m) (hn : sᶜ.card = n) : Sum (Fin m) (Fi
       Equiv.sumCongr (s.orderIsoOfFin hm).toEquiv <|
         (sᶜ.orderIsoOfFin hn).toEquiv.trans <| Equiv.Set.ofEq s.coe_compl
     _ ≃ α := Equiv.Set.sumCompl _
-
 #align fin_sum_equiv_of_finset finSumEquivOfFinset
 
 @[simp]

509de852

feat: Port data.fintype.sort (#1690)

Port of data.fintype.sort

No changes except docu fixes

Co-authored-by: Chris Hughes <33847686+ChrisHughes24@users.noreply.github.com> Co-authored-by: ChrisHughes24 <chrishughes24@gmail.com>

9793a3b2

`data.fintype.sort` ⟷ `Mathlib.Data.Fintype.Sort`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 183

data.fintype.sort ⟷ Mathlib.Data.Fintype.Sort

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 183

`data.fintype.sort` ⟷ `Mathlib.Data.Fintype.Sort`