control.bitraversable.basic | 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

6f1d45dc

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

69c6a5a1

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) 2018 Simon Hudon. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Simon Hudon
 -/
-import Mathbin.Control.Bifunctor
-import Mathbin.Control.Traversable.Basic
+import Control.Bifunctor
+import Control.Traversable.Basic
 
 #align_import control.bitraversable.basic from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"

69c6a5a1

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) 2018 Simon Hudon. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Simon Hudon
-
-! This file was ported from Lean 3 source module control.bitraversable.basic
-! leanprover-community/mathlib commit 69c6a5a12d8a2b159f20933e60115a4f2de62b58
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Control.Bifunctor
 import Mathbin.Control.Traversable.Basic
 
+#align_import control.bitraversable.basic from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"
+
 /-!
 # Bitraversable type class

69c6a5a1

bump to nightly-2023-06-21-09

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

7d4d846c

Diff

@@ -68,9 +68,9 @@ def bisequence {t m} [Bitraversable t] [Applicative m] {α β} : t (m α) (m β)
 
 open Functor
 
-#print IsLawfulBitraversable /-
+#print LawfulBitraversable /-
 /-- Bifunctor. This typeclass asserts that a lawless bitraversable bifunctor is lawful. -/
-class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
+class LawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
     LawfulBifunctor t where
   id_bitraverse : ∀ {α β} (x : t α β), bitraverse id.mk id.mk x = id.mk x
   comp_bitraverse :
@@ -85,12 +85,12 @@ class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t]
     ∀ {F G} [Applicative F] [Applicative G] [LawfulApplicative F] [LawfulApplicative G]
       (η : ApplicativeTransformation F G) {α α' β β'} (f : α → F β) (f' : α' → F β') (x : t α α'),
       η (bitraverse f f' x) = bitraverse (@η _ ∘ f) (@η _ ∘ f') x
-#align is_lawful_bitraversable IsLawfulBitraversable
+#align is_lawful_bitraversable LawfulBitraversable
 -/
 
-export IsLawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_id)
+export LawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_id)
 
-open IsLawfulBitraversable
+open LawfulBitraversable
 
 attribute [higher_order bitraverse_id_id] id_bitraverse
 
@@ -98,5 +98,5 @@ attribute [higher_order bitraverse_comp] comp_bitraverse
 
 attribute [higher_order] binaturality bitraverse_eq_bimap_id
 
-export IsLawfulBitraversable (bitraverse_id_id bitraverse_comp)
+export LawfulBitraversable (bitraverse_id_id bitraverse_comp)

69c6a5a1

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -71,7 +71,7 @@ open Functor
 #print IsLawfulBitraversable /-
 /-- Bifunctor. This typeclass asserts that a lawless bitraversable bifunctor is lawful. -/
 class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
-  LawfulBifunctor t where
+    LawfulBifunctor t where
   id_bitraverse : ∀ {α β} (x : t α β), bitraverse id.mk id.mk x = id.mk x
   comp_bitraverse :
     ∀ {F G} [Applicative F] [Applicative G] [LawfulApplicative F] [LawfulApplicative G]

69c6a5a1

bump to nightly-2023-05-19-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/95a87616d63b3cb49d3fe678d416fbe9c4217bf4

a31df521

Diff

@@ -92,11 +92,11 @@ export IsLawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_
 
 open IsLawfulBitraversable
 
-attribute [higher_order.1bitraverse_id_id] id_bitraverse
+attribute [higher_order bitraverse_id_id] id_bitraverse
 
-attribute [higher_order.1bitraverse_comp] comp_bitraverse
+attribute [higher_order bitraverse_comp] comp_bitraverse
 
-attribute [higher_order.1] binaturality bitraverse_eq_bimap_id
+attribute [higher_order] binaturality bitraverse_eq_bimap_id
 
 export IsLawfulBitraversable (bitraverse_id_id bitraverse_comp)

69c6a5a1

bump to nightly-2023-03-14-02

mathlib commit https://github.com/leanprover-community/mathlib/commit/2196ab363eb097c008d4497125e0dde23fb36db2

d4b38a42

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Simon Hudon
 
 ! This file was ported from Lean 3 source module control.bitraversable.basic
-! leanprover-community/mathlib commit 6f1d45dcccf674593073ee4e54da10ba35aedbc0
+! leanprover-community/mathlib commit 69c6a5a12d8a2b159f20933e60115a4f2de62b58
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.Control.Traversable.Basic
 /-!
 # Bitraversable type class
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 Type class for traversing bifunctors.
 
 Simple examples of `bitraversable` are `prod` and `sum`. A more elaborate example is

6f1d45dc

bump to nightly-2023-03-13-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/2af0836443b4cfb5feda0df0051acdb398304931

66e1e587

Diff

@@ -89,11 +89,11 @@ export IsLawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_
 
 open IsLawfulBitraversable
 
-attribute [higher_order bitraverse_id_id] id_bitraverse
+attribute [higher_order.1bitraverse_id_id] id_bitraverse
 
-attribute [higher_order bitraverse_comp] comp_bitraverse
+attribute [higher_order.1bitraverse_comp] comp_bitraverse
 
-attribute [higher_order] binaturality bitraverse_eq_bimap_id
+attribute [higher_order.1] binaturality bitraverse_eq_bimap_id
 
 export IsLawfulBitraversable (bitraverse_id_id bitraverse_comp)

6f1d45dc

bump to nightly-2023-03-11-18

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

1d00e3b6

Diff

@@ -45,22 +45,27 @@ traversable bitraversable iterator functor bifunctor applicative
 
 universe u
 
+#print Bitraversable /-
 /-- Lawless bitraversable bifunctor. This only holds data for the bimap and bitraverse. -/
 class Bitraversable (t : Type u → Type u → Type u) extends Bifunctor t where
   bitraverse :
     ∀ {m : Type u → Type u} [Applicative m] {α α' β β'},
       (α → m α') → (β → m β') → t α β → m (t α' β')
 #align bitraversable Bitraversable
+-/
 
 export Bitraversable (bitraverse)
 
+#print bisequence /-
 /-- A bitraversable functor commutes with all applicative functors. -/
 def bisequence {t m} [Bitraversable t] [Applicative m] {α β} : t (m α) (m β) → m (t α β) :=
   bitraverse id id
 #align bisequence bisequence
+-/
 
 open Functor
 
+#print IsLawfulBitraversable /-
 /-- Bifunctor. This typeclass asserts that a lawless bitraversable bifunctor is lawful. -/
 class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
   LawfulBifunctor t where
@@ -78,6 +83,7 @@ class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t]
       (η : ApplicativeTransformation F G) {α α' β β'} (f : α → F β) (f' : α' → F β') (x : t α α'),
       η (bitraverse f f' x) = bitraverse (@η _ ∘ f) (@η _ ∘ f') x
 #align is_lawful_bitraversable IsLawfulBitraversable
+-/
 
 export IsLawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_id)

6f1d45dc

bump to nightly-2023-03-08-14

mathlib commit https://github.com/leanprover-community/mathlib/commit/38f16f960f5006c6c0c2bac7b0aba5273188f4e5

f7af4b63

Diff

@@ -63,7 +63,7 @@ open Functor
 
 /-- Bifunctor. This typeclass asserts that a lawless bitraversable bifunctor is lawful. -/
 class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
-  IsLawfulBifunctor t where
+  LawfulBifunctor t where
   id_bitraverse : ∀ {α β} (x : t α β), bitraverse id.mk id.mk x = id.mk x
   comp_bitraverse :
     ∀ {F G} [Applicative F] [Applicative G] [LawfulApplicative F] [LawfulApplicative G]

6f1d45dc

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

6f1d45dc

feat: Linter that checks that Prop classes are Props (#6148)

930dd29d

Diff

@@ -60,7 +60,7 @@ open Functor
 
 /-- Bifunctor. This typeclass asserts that a lawless bitraversable bifunctor is lawful. -/
 class LawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
-  LawfulBifunctor t where
+  LawfulBifunctor t : Prop where
   -- Porting note: need to specify `m := Id` because `id` no longer has a `Monad` instance
   id_bitraverse : ∀ {α β} (x : t α β), bitraverse (m := Id) pure pure x = pure x
   comp_bitraverse :

6f1d45dc

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) 2018 Simon Hudon. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Simon Hudon
-
-! This file was ported from Lean 3 source module control.bitraversable.basic
-! leanprover-community/mathlib commit 6f1d45dcccf674593073ee4e54da10ba35aedbc0
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Control.Bifunctor
 import Mathlib.Control.Traversable.Basic
 
+#align_import control.bitraversable.basic from "leanprover-community/mathlib"@"6f1d45dcccf674593073ee4e54da10ba35aedbc0"
+
 /-!
 # Bitraversable type class

6f1d45dc

style: IsLawfulTraversable -> LawfulTraversable (#5737)

0c08a8fa

Diff

@@ -30,7 +30,7 @@ and value respectively with `Bitraverse f g : AList key val → IO (AList key' v
 
 * `Bitraversable`: Bare typeclass to hold the `Bitraverse` function.
 * `LawfulBitraversable`: Typeclass for the laws of the `Bitraverse` function. Similar to
-  `IsLawfulTraversable`.
+  `LawfulTraversable`.
 
 ## References

6f1d45dc

feat: port Control.Bitraversable.Instances (#5225)

98c34d9e

Diff

@@ -29,7 +29,7 @@ and value respectively with `Bitraverse f g : AList key val → IO (AList key' v
 ## Main definitions
 
 * `Bitraversable`: Bare typeclass to hold the `Bitraverse` function.
-* `IsLawfulBitraversable`: Typeclass for the laws of the `Bitraverse` function. Similar to
+* `LawfulBitraversable`: Typeclass for the laws of the `Bitraverse` function. Similar to
   `IsLawfulTraversable`.
 
 ## References
@@ -62,7 +62,7 @@ def bisequence {t m} [Bitraversable t] [Applicative m] {α β} : t (m α) (m β)
 open Functor
 
 /-- Bifunctor. This typeclass asserts that a lawless bitraversable bifunctor is lawful. -/
-class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
+class LawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t] extends
   LawfulBifunctor t where
   -- Porting note: need to specify `m := Id` because `id` no longer has a `Monad` instance
   id_bitraverse : ∀ {α β} (x : t α β), bitraverse (m := Id) pure pure x = pure x
@@ -78,11 +78,11 @@ class IsLawfulBitraversable (t : Type u → Type u → Type u) [Bitraversable t]
     ∀ {F G} [Applicative F] [Applicative G] [LawfulApplicative F] [LawfulApplicative G]
       (η : ApplicativeTransformation F G) {α α' β β'} (f : α → F β) (f' : α' → F β') (x : t α α'),
       η (bitraverse f f' x) = bitraverse (@η _ ∘ f) (@η _ ∘ f') x
-#align is_lawful_bitraversable IsLawfulBitraversable
+#align is_lawful_bitraversable LawfulBitraversable
 
-export IsLawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_id)
+export LawfulBitraversable (id_bitraverse comp_bitraverse bitraverse_eq_bimap_id)
 
-open IsLawfulBitraversable
+open LawfulBitraversable
 
 attribute [higher_order bitraverse_id_id] id_bitraverse
 
@@ -90,4 +90,4 @@ attribute [higher_order bitraverse_comp] comp_bitraverse
 
 attribute [higher_order] binaturality bitraverse_eq_bimap_id
 
-export IsLawfulBitraversable (bitraverse_id_id bitraverse_comp)
+export LawfulBitraversable (bitraverse_id_id bitraverse_comp)

6f1d45dc

feat: port Control.Bitraversable.Basic (#2804)

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

575293ad

`control.bitraversable.basic` ⟷ `Mathlib.Control.Bitraversable.Basic`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2

control.bitraversable.basic ⟷ Mathlib.Control.Bitraversable.Basic

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2

`control.bitraversable.basic` ⟷ `Mathlib.Control.Bitraversable.Basic`