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

58581d0f

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

8eb9c42d

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2019 Simon Hudon. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Simon Hudon
 -/
-import Mathbin.Control.Bitraversable.Basic
+import Control.Bitraversable.Basic
 
 #align_import control.bitraversable.lemmas from "leanprover-community/mathlib"@"8eb9c42d4d34c77f6ee84ea766ae4070233a973c"

8eb9c42d

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2019 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.lemmas
-! leanprover-community/mathlib commit 8eb9c42d4d34c77f6ee84ea766ae4070233a973c
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Control.Bitraversable.Basic
 
+#align_import control.bitraversable.lemmas from "leanprover-community/mathlib"@"8eb9c42d4d34c77f6ee84ea766ae4070233a973c"
+
 /-!
 # Bitraversable Lemmas

8eb9c42d

bump to nightly-2023-06-21-09

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

7d4d846c

Diff

@@ -69,7 +69,7 @@ def tsnd {α α'} (f : α → F α') : t β α → F (t β α') :=
 #align bitraversable.tsnd Bitraversable.tsnd
 -/
 
-variable [IsLawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
+variable [LawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
 
 #print Bitraversable.id_tfst /-
 @[higher_order tfst_id]

8eb9c42d

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -71,39 +71,51 @@ def tsnd {α α'} (f : α → F α') : t β α → F (t β α') :=
 
 variable [IsLawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
 
+#print Bitraversable.id_tfst /-
 @[higher_order tfst_id]
 theorem id_tfst : ∀ {α β} (x : t α β), tfst id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tfst Bitraversable.id_tfst
+-/
 
+#print Bitraversable.id_tsnd /-
 @[higher_order tsnd_id]
 theorem id_tsnd : ∀ {α β} (x : t α β), tsnd id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tsnd Bitraversable.id_tsnd
+-/
 
+#print Bitraversable.comp_tfst /-
 @[higher_order tfst_comp_tfst]
 theorem comp_tfst {α₀ α₁ α₂ β} (f : α₀ → F α₁) (f' : α₁ → G α₂) (x : t α₀ β) :
     Comp.mk (tfst f' <$> tfst f x) = tfst (Comp.mk ∘ map f' ∘ f) x := by
   rw [← comp_bitraverse] <;> simp [tfst, map_comp_pure, Pure.pure]
 #align bitraversable.comp_tfst Bitraversable.comp_tfst
+-/
 
+#print Bitraversable.tfst_tsnd /-
 @[higher_order tfst_comp_tsnd]
 theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tfst f <$> tsnd f' x) = bitraverse (Comp.mk ∘ pure ∘ f) (Comp.mk ∘ map pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tfst_tsnd Bitraversable.tfst_tsnd
+-/
 
+#print Bitraversable.tsnd_tfst /-
 @[higher_order tsnd_comp_tfst]
 theorem tsnd_tfst {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tsnd f' <$> tfst f x) = bitraverse (Comp.mk ∘ map pure ∘ f) (Comp.mk ∘ pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tsnd_tfst Bitraversable.tsnd_tfst
+-/
 
+#print Bitraversable.comp_tsnd /-
 @[higher_order tsnd_comp_tsnd]
 theorem comp_tsnd {α β₀ β₁ β₂} (g : β₀ → F β₁) (g' : β₁ → G β₂) (x : t α β₀) :
     Comp.mk (tsnd g' <$> tsnd g x) = tsnd (Comp.mk ∘ map g' ∘ g) x := by
   rw [← comp_bitraverse] <;> simp [tsnd] <;> rfl
 #align bitraversable.comp_tsnd Bitraversable.comp_tsnd
+-/
 
 open Bifunctor
 
@@ -112,15 +124,19 @@ private theorem pure_eq_id_mk_comp_id {α} : pure = id.mk ∘ @id α :=
 
 open Function
 
+#print Bitraversable.tfst_eq_fst_id /-
 @[higher_order]
 theorem tfst_eq_fst_id {α α' β} (f : α → α') (x : t α β) : tfst (id.mk ∘ f) x = id.mk (fst f x) :=
   by simp [tfst, fst, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_id
+-/
 
+#print Bitraversable.tsnd_eq_snd_id /-
 @[higher_order]
 theorem tsnd_eq_snd_id {α β β'} (f : β → β') (x : t α β) : tsnd (id.mk ∘ f) x = id.mk (snd f x) :=
   by simp [tsnd, snd, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_id
+-/
 
 attribute [functor_norm] comp_bitraverse comp_tsnd comp_tfst tsnd_comp_tsnd tsnd_comp_tfst
   tfst_comp_tsnd tfst_comp_tfst bitraverse_comp bitraverse_id_id tfst_id tsnd_id

8eb9c42d

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -122,8 +122,8 @@ theorem tsnd_eq_snd_id {α β β'} (f : β → β') (x : t α β) : tsnd (id.mk
   by simp [tsnd, snd, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_id
 
-attribute [functor_norm]
-  comp_bitraverse comp_tsnd comp_tfst tsnd_comp_tsnd tsnd_comp_tfst tfst_comp_tsnd tfst_comp_tfst bitraverse_comp bitraverse_id_id tfst_id tsnd_id
+attribute [functor_norm] comp_bitraverse comp_tsnd comp_tfst tsnd_comp_tsnd tsnd_comp_tfst
+  tfst_comp_tsnd tfst_comp_tfst bitraverse_comp bitraverse_id_id tfst_id tsnd_id
 
 end Bitraversable

8eb9c42d

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -71,64 +71,34 @@ def tsnd {α α'} (f : α → F α') : t β α → F (t β α') :=
 
 variable [IsLawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
 
-/- warning: bitraversable.id_tfst -> Bitraversable.id_tfst is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α β)) (Bitraversable.tfst.{u1} t _inst_1 β (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) α α (id.mk.{succ u1} α) x) (id.mk.{succ u1} (t α β) x)
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (Id.{u1} (t α β)) (Bitraversable.tfst.{u1} t _inst_1 β Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) α α (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) α) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β) x)
-Case conversion may be inaccurate. Consider using '#align bitraversable.id_tfst Bitraversable.id_tfstₓ'. -/
 @[higher_order tfst_id]
 theorem id_tfst : ∀ {α β} (x : t α β), tfst id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tfst Bitraversable.id_tfst
 
-/- warning: bitraversable.id_tsnd -> Bitraversable.id_tsnd is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α β)) (Bitraversable.tsnd.{u1} t _inst_1 α (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) β β (id.mk.{succ u1} β) x) (id.mk.{succ u1} (t α β) x)
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (Id.{u1} (t α β)) (Bitraversable.tsnd.{u1} t _inst_1 α Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) β β (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) β) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β) x)
-Case conversion may be inaccurate. Consider using '#align bitraversable.id_tsnd Bitraversable.id_tsndₓ'. -/
 @[higher_order tsnd_id]
 theorem id_tsnd : ∀ {α β} (x : t α β), tsnd id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tsnd Bitraversable.id_tsnd
 
-/- warning: bitraversable.comp_tfst -> Bitraversable.comp_tfst is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {α₂ : Type.{u1}} {β : Type.{u1}} (f : α₀ -> (F α₁)) (f' : α₁ -> (G α₂)) (x : t α₀ β), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G (t α₂ β)) (Functor.Comp.mk.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G (t α₂ β) (Functor.map.{u1, u1} (fun {α₁ : Type.{u1}} => F α₁) (Applicative.toFunctor.{u1, u1} (fun {α₁ : Type.{u1}} => F α₁) _inst_2) (t α₁ β) (G (t α₂ β)) (Bitraversable.tfst.{u1} t _inst_1 β G _inst_3 α₁ α₂ f') (Bitraversable.tfst.{u1} t _inst_1 β (fun {α₁ : Type.{u1}} => F α₁) _inst_2 α₀ α₁ f x))) (Bitraversable.tfst.{u1} t _inst_1 β (Functor.Comp.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G) (Functor.Comp.applicative.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G _inst_2 _inst_3) α₀ α₂ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₂)) (Functor.Comp.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G α₂) (Functor.Comp.mk.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G α₂) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₂) f') f)) x)
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {α₂ : Type.{u1}} {β : Type.{u1}} (f : α₀ -> (F α₁)) (f' : α₁ -> (G α₂)) (x : t α₀ β), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₂ β)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₂ β) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β) (G (t α₂ β)) (Bitraversable.tfst.{u1} t _inst_1 β G _inst_3 α₁ α₂ f') (Bitraversable.tfst.{u1} t _inst_1 β F _inst_2 α₀ α₁ f x))) (Bitraversable.tfst.{u1} t _inst_1 β (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₂ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₂)) (Functor.Comp.{u1, u1, u1} F G α₂) (Functor.Comp.mk.{u1, u1, u1} F G α₂) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₂) f') f)) x)
-Case conversion may be inaccurate. Consider using '#align bitraversable.comp_tfst Bitraversable.comp_tfstₓ'. -/
 @[higher_order tfst_comp_tfst]
 theorem comp_tfst {α₀ α₁ α₂ β} (f : α₀ → F α₁) (f' : α₁ → G α₂) (x : t α₀ β) :
     Comp.mk (tfst f' <$> tfst f x) = tfst (Comp.mk ∘ map f' ∘ f) x := by
   rw [← comp_bitraverse] <;> simp [tfst, map_comp_pure, Pure.pure]
 #align bitraversable.comp_tfst Bitraversable.comp_tfst
 
-/- warning: bitraversable.tfst_tsnd -> Bitraversable.tfst_tsnd is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_tsnd Bitraversable.tfst_tsndₓ'. -/
 @[higher_order tfst_comp_tsnd]
 theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tfst f <$> tsnd f' x) = bitraverse (Comp.mk ∘ pure ∘ f) (Comp.mk ∘ map pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tfst_tsnd Bitraversable.tfst_tsnd
 
-/- warning: bitraversable.tsnd_tfst -> Bitraversable.tsnd_tfst is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_tfst Bitraversable.tsnd_tfstₓ'. -/
 @[higher_order tsnd_comp_tfst]
 theorem tsnd_tfst {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tsnd f' <$> tfst f x) = bitraverse (Comp.mk ∘ map pure ∘ f) (Comp.mk ∘ pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tsnd_tfst Bitraversable.tsnd_tfst
 
-/- warning: bitraversable.comp_tsnd -> Bitraversable.comp_tsnd is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} {β₂ : Type.{u1}} (g : β₀ -> (F β₁)) (g' : β₁ -> (G β₂)) (x : t α β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G (t α β₂)) (Functor.Comp.mk.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G (t α β₂) (Functor.map.{u1, u1} (fun {β₁ : Type.{u1}} => F β₁) (Applicative.toFunctor.{u1, u1} (fun {β₁ : Type.{u1}} => F β₁) _inst_2) (t α β₁) (G (t α β₂)) (Bitraversable.tsnd.{u1} t _inst_1 α G _inst_3 β₁ β₂ g') (Bitraversable.tsnd.{u1} t _inst_1 α (fun {β₁ : Type.{u1}} => F β₁) _inst_2 β₀ β₁ g x))) (Bitraversable.tsnd.{u1} t _inst_1 α (Functor.Comp.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G) (Functor.Comp.applicative.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G _inst_2 _inst_3) β₀ β₂ (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₂)) (Functor.Comp.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G β₂) (Functor.Comp.mk.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G β₂) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F β₁) (F (G β₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) β₁ (G β₂) g') g)) x)
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} {β₂ : Type.{u1}} (g : β₀ -> (F β₁)) (g' : β₁ -> (G β₂)) (x : t α β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α β₂)) (Functor.Comp.mk.{u1, u1, u1} F G (t α β₂) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α β₁) (G (t α β₂)) (Bitraversable.tsnd.{u1} t _inst_1 α G _inst_3 β₁ β₂ g') (Bitraversable.tsnd.{u1} t _inst_1 α F _inst_2 β₀ β₁ g x))) (Bitraversable.tsnd.{u1} t _inst_1 α (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) β₀ β₂ (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₂)) (Functor.Comp.{u1, u1, u1} F G β₂) (Functor.Comp.mk.{u1, u1, u1} F G β₂) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F β₁) (F (G β₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) β₁ (G β₂) g') g)) x)
-Case conversion may be inaccurate. Consider using '#align bitraversable.comp_tsnd Bitraversable.comp_tsndₓ'. -/
 @[higher_order tsnd_comp_tsnd]
 theorem comp_tsnd {α β₀ β₁ β₂} (g : β₀ → F β₁) (g' : β₁ → G β₂) (x : t α β₀) :
     Comp.mk (tsnd g' <$> tsnd g x) = tsnd (Comp.mk ∘ map g' ∘ g) x := by
@@ -142,23 +112,11 @@ private theorem pure_eq_id_mk_comp_id {α} : pure = id.mk ∘ @id α :=
 
 open Function
 
-/- warning: bitraversable.tfst_eq_fst_id -> Bitraversable.tfst_eq_fst_id is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {α' : Type.{u1}} {β : Type.{u1}} (f : α -> α') (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α' β)) (Bitraversable.tfst.{u1} t _inst_1 β (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) α α' (Function.comp.{succ u1, succ u1, succ u1} α α' (id.{succ (succ u1)} Type.{u1} α') (id.mk.{succ u1} α') f) x) (id.mk.{succ u1} (t α' β) (Bifunctor.fst.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α α' β f x))
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {α' : Type.{u1}} {β : Type.{u1}} (f : α -> α') (x : t α β), Eq.{succ u1} (Id.{u1} (t α' β)) (Bitraversable.tfst.{u1} t _inst_1 β Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) α α' (Function.comp.{succ u1, succ u1, succ u1} α α' (Id.{u1} α') (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) α') f) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α' β) (Bifunctor.fst.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α α' β f x))
-Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_idₓ'. -/
 @[higher_order]
 theorem tfst_eq_fst_id {α α' β} (f : α → α') (x : t α β) : tfst (id.mk ∘ f) x = id.mk (fst f x) :=
   by simp [tfst, fst, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_id
 
-/- warning: bitraversable.tsnd_eq_snd_id -> Bitraversable.tsnd_eq_snd_id is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} {β' : Type.{u1}} (f : β -> β') (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α β')) (Bitraversable.tsnd.{u1} t _inst_1 α (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) β β' (Function.comp.{succ u1, succ u1, succ u1} β β' (id.{succ (succ u1)} Type.{u1} β') (id.mk.{succ u1} β') f) x) (id.mk.{succ u1} (t α β') (Bifunctor.snd.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α β β' f x))
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} {β' : Type.{u1}} (f : β -> β') (x : t α β), Eq.{succ u1} (Id.{u1} (t α β')) (Bitraversable.tsnd.{u1} t _inst_1 α Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) β β' (Function.comp.{succ u1, succ u1, succ u1} β β' (Id.{u1} β') (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) β') f) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β') (Bifunctor.snd.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α β β' f x))
-Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_idₓ'. -/
 @[higher_order]
 theorem tsnd_eq_snd_id {α β β'} (f : β → β') (x : t α β) : tsnd (id.mk ∘ f) x = id.mk (snd f x) :=
   by simp [tsnd, snd, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]

8eb9c42d

bump to nightly-2023-05-28-03

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

6c6011cf

Diff

@@ -106,10 +106,7 @@ theorem comp_tfst {α₀ α₁ α₂ β} (f : α₀ → F α₁) (f' : α₁ →
 #align bitraversable.comp_tfst Bitraversable.comp_tfst
 
 /- warning: bitraversable.tfst_tsnd -> Bitraversable.tfst_tsnd is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} G F (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} G F (t α₁ β₁) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) (t α₀ β₁) (F (t α₁ β₁)) (Bitraversable.tfst.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 β₁ F _inst_2 α₀ α₁ f) (Bitraversable.tsnd.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 α₀ G _inst_3 β₀ β₁ f' x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} G F) (Functor.Comp.applicative.{u1, u1, u1} G F _inst_3 _inst_2) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (G (F α₁)) (Functor.Comp.{u1, u1, u1} G F α₁) (Functor.Comp.mk.{u1, u1, u1} G F α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (G (F α₁)) (Pure.pure.{u1, u1} G (Applicative.toHasPure.{u1, u1} G _inst_3) (F α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G (F β₁)) (Functor.Comp.{u1, u1, u1} G F β₁) (Functor.Comp.mk.{u1, u1, u1} G F β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (G (F β₁)) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) β₁ (F β₁) (Pure.pure.{u1, u1} F (Applicative.toHasPure.{u1, u1} F _inst_2) β₁)) f')) x)
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} G F (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} G F (t α₁ β₁) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) (t α₀ β₁) (F (t α₁ β₁)) (Bitraversable.tfst.{u1} t _inst_1 β₁ F _inst_2 α₀ α₁ f) (Bitraversable.tsnd.{u1} t _inst_1 α₀ G _inst_3 β₀ β₁ f' x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} G F) (Functor.Comp.instApplicativeComp.{u1, u1, u1} G F _inst_3 _inst_2) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (G (F α₁)) (Functor.Comp.{u1, u1, u1} G F α₁) (Functor.Comp.mk.{u1, u1, u1} G F α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (G (F α₁)) (Pure.pure.{u1, u1} G (Applicative.toPure.{u1, u1} G _inst_3) (F α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G (F β₁)) (Functor.Comp.{u1, u1, u1} G F β₁) (Functor.Comp.mk.{u1, u1, u1} G F β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (G (F β₁)) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) β₁ (F β₁) (Pure.pure.{u1, u1} F (Applicative.toPure.{u1, u1} F _inst_2) β₁)) f')) x)
+<too large>
 Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_tsnd Bitraversable.tfst_tsndₓ'. -/
 @[higher_order tfst_comp_tsnd]
 theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
@@ -118,10 +115,7 @@ theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀
 #align bitraversable.tfst_tsnd Bitraversable.tfst_tsnd
 
 /- warning: bitraversable.tsnd_tfst -> Bitraversable.tsnd_tfst is a dubious translation:
-lean 3 declaration is
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₁ β₁) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β₀) (G (t α₁ β₁)) (Bitraversable.tsnd.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 α₁ G _inst_3 β₀ β₁ f') (Bitraversable.tfst.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 β₀ F _inst_2 α₀ α₁ f x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.applicative.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₁)) (Functor.Comp.{u1, u1, u1} F G α₁) (Functor.Comp.mk.{u1, u1, u1} F G α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₁)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₁) (Pure.pure.{u1, u1} G (Applicative.toHasPure.{u1, u1} G _inst_3) α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₁)) (Functor.Comp.{u1, u1, u1} F G β₁) (Functor.Comp.mk.{u1, u1, u1} F G β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (F (G β₁)) (Pure.pure.{u1, u1} F (Applicative.toHasPure.{u1, u1} F _inst_2) (G β₁)) f')) x)
-but is expected to have type
-  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₁ β₁) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β₀) (G (t α₁ β₁)) (Bitraversable.tsnd.{u1} t _inst_1 α₁ G _inst_3 β₀ β₁ f') (Bitraversable.tfst.{u1} t _inst_1 β₀ F _inst_2 α₀ α₁ f x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₁)) (Functor.Comp.{u1, u1, u1} F G α₁) (Functor.Comp.mk.{u1, u1, u1} F G α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₁)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₁) (Pure.pure.{u1, u1} G (Applicative.toPure.{u1, u1} G _inst_3) α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₁)) (Functor.Comp.{u1, u1, u1} F G β₁) (Functor.Comp.mk.{u1, u1, u1} F G β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (F (G β₁)) (Pure.pure.{u1, u1} F (Applicative.toPure.{u1, u1} F _inst_2) (G β₁)) f')) x)
+<too large>
 Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_tfst Bitraversable.tsnd_tfstₓ'. -/
 @[higher_order tsnd_comp_tfst]
 theorem tsnd_tfst {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
@@ -145,7 +139,6 @@ open Bifunctor
 
 private theorem pure_eq_id_mk_comp_id {α} : pure = id.mk ∘ @id α :=
   rfl
-#align bitraversable.pure_eq_id_mk_comp_id bitraversable.pure_eq_id_mk_comp_id
 
 open Function

8eb9c42d

bump to nightly-2023-05-19-16

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

a31df521

Diff

@@ -77,7 +77,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (Id.{u1} (t α β)) (Bitraversable.tfst.{u1} t _inst_1 β Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) α α (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) α) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β) x)
 Case conversion may be inaccurate. Consider using '#align bitraversable.id_tfst Bitraversable.id_tfstₓ'. -/
-@[higher_order.1tfst_id]
+@[higher_order tfst_id]
 theorem id_tfst : ∀ {α β} (x : t α β), tfst id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tfst Bitraversable.id_tfst
@@ -88,7 +88,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (Id.{u1} (t α β)) (Bitraversable.tsnd.{u1} t _inst_1 α Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) β β (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) β) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β) x)
 Case conversion may be inaccurate. Consider using '#align bitraversable.id_tsnd Bitraversable.id_tsndₓ'. -/
-@[higher_order.1tsnd_id]
+@[higher_order tsnd_id]
 theorem id_tsnd : ∀ {α β} (x : t α β), tsnd id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tsnd Bitraversable.id_tsnd
@@ -99,7 +99,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {α₂ : Type.{u1}} {β : Type.{u1}} (f : α₀ -> (F α₁)) (f' : α₁ -> (G α₂)) (x : t α₀ β), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₂ β)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₂ β) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β) (G (t α₂ β)) (Bitraversable.tfst.{u1} t _inst_1 β G _inst_3 α₁ α₂ f') (Bitraversable.tfst.{u1} t _inst_1 β F _inst_2 α₀ α₁ f x))) (Bitraversable.tfst.{u1} t _inst_1 β (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₂ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₂)) (Functor.Comp.{u1, u1, u1} F G α₂) (Functor.Comp.mk.{u1, u1, u1} F G α₂) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₂) f') f)) x)
 Case conversion may be inaccurate. Consider using '#align bitraversable.comp_tfst Bitraversable.comp_tfstₓ'. -/
-@[higher_order.1tfst_comp_tfst]
+@[higher_order tfst_comp_tfst]
 theorem comp_tfst {α₀ α₁ α₂ β} (f : α₀ → F α₁) (f' : α₁ → G α₂) (x : t α₀ β) :
     Comp.mk (tfst f' <$> tfst f x) = tfst (Comp.mk ∘ map f' ∘ f) x := by
   rw [← comp_bitraverse] <;> simp [tfst, map_comp_pure, Pure.pure]
@@ -111,7 +111,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} G F (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} G F (t α₁ β₁) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) (t α₀ β₁) (F (t α₁ β₁)) (Bitraversable.tfst.{u1} t _inst_1 β₁ F _inst_2 α₀ α₁ f) (Bitraversable.tsnd.{u1} t _inst_1 α₀ G _inst_3 β₀ β₁ f' x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} G F) (Functor.Comp.instApplicativeComp.{u1, u1, u1} G F _inst_3 _inst_2) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (G (F α₁)) (Functor.Comp.{u1, u1, u1} G F α₁) (Functor.Comp.mk.{u1, u1, u1} G F α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (G (F α₁)) (Pure.pure.{u1, u1} G (Applicative.toPure.{u1, u1} G _inst_3) (F α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G (F β₁)) (Functor.Comp.{u1, u1, u1} G F β₁) (Functor.Comp.mk.{u1, u1, u1} G F β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (G (F β₁)) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) β₁ (F β₁) (Pure.pure.{u1, u1} F (Applicative.toPure.{u1, u1} F _inst_2) β₁)) f')) x)
 Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_tsnd Bitraversable.tfst_tsndₓ'. -/
-@[higher_order.1tfst_comp_tsnd]
+@[higher_order tfst_comp_tsnd]
 theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tfst f <$> tsnd f' x) = bitraverse (Comp.mk ∘ pure ∘ f) (Comp.mk ∘ map pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
@@ -123,7 +123,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₁ β₁) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β₀) (G (t α₁ β₁)) (Bitraversable.tsnd.{u1} t _inst_1 α₁ G _inst_3 β₀ β₁ f') (Bitraversable.tfst.{u1} t _inst_1 β₀ F _inst_2 α₀ α₁ f x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₁)) (Functor.Comp.{u1, u1, u1} F G α₁) (Functor.Comp.mk.{u1, u1, u1} F G α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₁)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₁) (Pure.pure.{u1, u1} G (Applicative.toPure.{u1, u1} G _inst_3) α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₁)) (Functor.Comp.{u1, u1, u1} F G β₁) (Functor.Comp.mk.{u1, u1, u1} F G β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (F (G β₁)) (Pure.pure.{u1, u1} F (Applicative.toPure.{u1, u1} F _inst_2) (G β₁)) f')) x)
 Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_tfst Bitraversable.tsnd_tfstₓ'. -/
-@[higher_order.1tsnd_comp_tfst]
+@[higher_order tsnd_comp_tfst]
 theorem tsnd_tfst {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tsnd f' <$> tfst f x) = bitraverse (Comp.mk ∘ map pure ∘ f) (Comp.mk ∘ pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
@@ -135,7 +135,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} {β₂ : Type.{u1}} (g : β₀ -> (F β₁)) (g' : β₁ -> (G β₂)) (x : t α β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α β₂)) (Functor.Comp.mk.{u1, u1, u1} F G (t α β₂) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α β₁) (G (t α β₂)) (Bitraversable.tsnd.{u1} t _inst_1 α G _inst_3 β₁ β₂ g') (Bitraversable.tsnd.{u1} t _inst_1 α F _inst_2 β₀ β₁ g x))) (Bitraversable.tsnd.{u1} t _inst_1 α (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) β₀ β₂ (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₂)) (Functor.Comp.{u1, u1, u1} F G β₂) (Functor.Comp.mk.{u1, u1, u1} F G β₂) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F β₁) (F (G β₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) β₁ (G β₂) g') g)) x)
 Case conversion may be inaccurate. Consider using '#align bitraversable.comp_tsnd Bitraversable.comp_tsndₓ'. -/
-@[higher_order.1tsnd_comp_tsnd]
+@[higher_order tsnd_comp_tsnd]
 theorem comp_tsnd {α β₀ β₁ β₂} (g : β₀ → F β₁) (g' : β₁ → G β₂) (x : t α β₀) :
     Comp.mk (tsnd g' <$> tsnd g x) = tsnd (Comp.mk ∘ map g' ∘ g) x := by
   rw [← comp_bitraverse] <;> simp [tsnd] <;> rfl
@@ -155,7 +155,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {α' : Type.{u1}} {β : Type.{u1}} (f : α -> α') (x : t α β), Eq.{succ u1} (Id.{u1} (t α' β)) (Bitraversable.tfst.{u1} t _inst_1 β Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) α α' (Function.comp.{succ u1, succ u1, succ u1} α α' (Id.{u1} α') (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) α') f) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α' β) (Bifunctor.fst.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α α' β f x))
 Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_idₓ'. -/
-@[higher_order.1]
+@[higher_order]
 theorem tfst_eq_fst_id {α α' β} (f : α → α') (x : t α β) : tfst (id.mk ∘ f) x = id.mk (fst f x) :=
   by simp [tfst, fst, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_id
@@ -166,7 +166,7 @@ lean 3 declaration is
 but is expected to have type
   forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} {β' : Type.{u1}} (f : β -> β') (x : t α β), Eq.{succ u1} (Id.{u1} (t α β')) (Bitraversable.tsnd.{u1} t _inst_1 α Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) β β' (Function.comp.{succ u1, succ u1, succ u1} β β' (Id.{u1} β') (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) β') f) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β') (Bifunctor.snd.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α β β' f x))
 Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_idₓ'. -/
-@[higher_order.1]
+@[higher_order]
 theorem tsnd_eq_snd_id {α β β'} (f : β → β') (x : t α β) : tsnd (id.mk ∘ f) x = id.mk (snd f x) :=
   by simp [tsnd, snd, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_id

8eb9c42d

bump to nightly-2023-04-20-02

mathlib commit https://github.com/leanprover-community/mathlib/commit/730c6d4cab72b9d84fcfb9e95e8796e9cd8f40ba

70125a69

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.lemmas
-! leanprover-community/mathlib commit 58581d0fe523063f5651df0619be2bf65012a94a
+! leanprover-community/mathlib commit 8eb9c42d4d34c77f6ee84ea766ae4070233a973c
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.Control.Bitraversable.Basic
 /-!
 # Bitraversable Lemmas
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 ## Main definitions
   * tfst - traverse on first functor argument
   * tsnd - traverse on second functor argument

58581d0f

bump to nightly-2023-04-18-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/49b7f94aab3a3bdca1f9f34c5d818afb253b3993

bba1f0fa

Diff

@@ -50,48 +50,88 @@ open Functor LawfulApplicative
 
 variable {F G : Type u → Type u} [Applicative F] [Applicative G]
 
+#print Bitraversable.tfst /-
 /-- traverse on the first functor argument -/
 @[reducible]
 def tfst {α α'} (f : α → F α') : t α β → F (t α' β) :=
   bitraverse f pure
 #align bitraversable.tfst Bitraversable.tfst
+-/
 
+#print Bitraversable.tsnd /-
 /-- traverse on the second functor argument -/
 @[reducible]
 def tsnd {α α'} (f : α → F α') : t β α → F (t β α') :=
   bitraverse pure f
 #align bitraversable.tsnd Bitraversable.tsnd
+-/
 
 variable [IsLawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
 
+/- warning: bitraversable.id_tfst -> Bitraversable.id_tfst is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α β)) (Bitraversable.tfst.{u1} t _inst_1 β (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) α α (id.mk.{succ u1} α) x) (id.mk.{succ u1} (t α β) x)
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (Id.{u1} (t α β)) (Bitraversable.tfst.{u1} t _inst_1 β Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) α α (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) α) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β) x)
+Case conversion may be inaccurate. Consider using '#align bitraversable.id_tfst Bitraversable.id_tfstₓ'. -/
 @[higher_order.1tfst_id]
 theorem id_tfst : ∀ {α β} (x : t α β), tfst id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tfst Bitraversable.id_tfst
 
+/- warning: bitraversable.id_tsnd -> Bitraversable.id_tsnd is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α β)) (Bitraversable.tsnd.{u1} t _inst_1 α (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) β β (id.mk.{succ u1} β) x) (id.mk.{succ u1} (t α β) x)
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} (x : t α β), Eq.{succ u1} (Id.{u1} (t α β)) (Bitraversable.tsnd.{u1} t _inst_1 α Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) β β (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) β) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β) x)
+Case conversion may be inaccurate. Consider using '#align bitraversable.id_tsnd Bitraversable.id_tsndₓ'. -/
 @[higher_order.1tsnd_id]
 theorem id_tsnd : ∀ {α β} (x : t α β), tsnd id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tsnd Bitraversable.id_tsnd
 
+/- warning: bitraversable.comp_tfst -> Bitraversable.comp_tfst is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {α₂ : Type.{u1}} {β : Type.{u1}} (f : α₀ -> (F α₁)) (f' : α₁ -> (G α₂)) (x : t α₀ β), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G (t α₂ β)) (Functor.Comp.mk.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G (t α₂ β) (Functor.map.{u1, u1} (fun {α₁ : Type.{u1}} => F α₁) (Applicative.toFunctor.{u1, u1} (fun {α₁ : Type.{u1}} => F α₁) _inst_2) (t α₁ β) (G (t α₂ β)) (Bitraversable.tfst.{u1} t _inst_1 β G _inst_3 α₁ α₂ f') (Bitraversable.tfst.{u1} t _inst_1 β (fun {α₁ : Type.{u1}} => F α₁) _inst_2 α₀ α₁ f x))) (Bitraversable.tfst.{u1} t _inst_1 β (Functor.Comp.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G) (Functor.Comp.applicative.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G _inst_2 _inst_3) α₀ α₂ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₂)) (Functor.Comp.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G α₂) (Functor.Comp.mk.{u1, u1, u1} (fun {α₁ : Type.{u1}} => F α₁) G α₂) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₂) f') f)) x)
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {α₂ : Type.{u1}} {β : Type.{u1}} (f : α₀ -> (F α₁)) (f' : α₁ -> (G α₂)) (x : t α₀ β), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₂ β)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₂ β) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β) (G (t α₂ β)) (Bitraversable.tfst.{u1} t _inst_1 β G _inst_3 α₁ α₂ f') (Bitraversable.tfst.{u1} t _inst_1 β F _inst_2 α₀ α₁ f x))) (Bitraversable.tfst.{u1} t _inst_1 β (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₂ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₂)) (Functor.Comp.{u1, u1, u1} F G α₂) (Functor.Comp.mk.{u1, u1, u1} F G α₂) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₂) f') f)) x)
+Case conversion may be inaccurate. Consider using '#align bitraversable.comp_tfst Bitraversable.comp_tfstₓ'. -/
 @[higher_order.1tfst_comp_tfst]
 theorem comp_tfst {α₀ α₁ α₂ β} (f : α₀ → F α₁) (f' : α₁ → G α₂) (x : t α₀ β) :
     Comp.mk (tfst f' <$> tfst f x) = tfst (Comp.mk ∘ map f' ∘ f) x := by
   rw [← comp_bitraverse] <;> simp [tfst, map_comp_pure, Pure.pure]
 #align bitraversable.comp_tfst Bitraversable.comp_tfst
 
+/- warning: bitraversable.tfst_tsnd -> Bitraversable.tfst_tsnd is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} G F (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} G F (t α₁ β₁) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) (t α₀ β₁) (F (t α₁ β₁)) (Bitraversable.tfst.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 β₁ F _inst_2 α₀ α₁ f) (Bitraversable.tsnd.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 α₀ G _inst_3 β₀ β₁ f' x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} G F) (Functor.Comp.applicative.{u1, u1, u1} G F _inst_3 _inst_2) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (G (F α₁)) (Functor.Comp.{u1, u1, u1} G F α₁) (Functor.Comp.mk.{u1, u1, u1} G F α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (G (F α₁)) (Pure.pure.{u1, u1} G (Applicative.toHasPure.{u1, u1} G _inst_3) (F α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G (F β₁)) (Functor.Comp.{u1, u1, u1} G F β₁) (Functor.Comp.mk.{u1, u1, u1} G F β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (G (F β₁)) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) β₁ (F β₁) (Pure.pure.{u1, u1} F (Applicative.toHasPure.{u1, u1} F _inst_2) β₁)) f')) x)
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} G F (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} G F (t α₁ β₁) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) (t α₀ β₁) (F (t α₁ β₁)) (Bitraversable.tfst.{u1} t _inst_1 β₁ F _inst_2 α₀ α₁ f) (Bitraversable.tsnd.{u1} t _inst_1 α₀ G _inst_3 β₀ β₁ f' x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} G F) (Functor.Comp.instApplicativeComp.{u1, u1, u1} G F _inst_3 _inst_2) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (G (F α₁)) (Functor.Comp.{u1, u1, u1} G F α₁) (Functor.Comp.mk.{u1, u1, u1} G F α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (G (F α₁)) (Pure.pure.{u1, u1} G (Applicative.toPure.{u1, u1} G _inst_3) (F α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G (F β₁)) (Functor.Comp.{u1, u1, u1} G F β₁) (Functor.Comp.mk.{u1, u1, u1} G F β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (G (F β₁)) (Functor.map.{u1, u1} G (Applicative.toFunctor.{u1, u1} G _inst_3) β₁ (F β₁) (Pure.pure.{u1, u1} F (Applicative.toPure.{u1, u1} F _inst_2) β₁)) f')) x)
+Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_tsnd Bitraversable.tfst_tsndₓ'. -/
 @[higher_order.1tfst_comp_tsnd]
 theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tfst f <$> tsnd f' x) = bitraverse (Comp.mk ∘ pure ∘ f) (Comp.mk ∘ map pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tfst_tsnd Bitraversable.tfst_tsnd
 
+/- warning: bitraversable.tsnd_tfst -> Bitraversable.tsnd_tfst is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₁ β₁) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β₀) (G (t α₁ β₁)) (Bitraversable.tsnd.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 α₁ G _inst_3 β₀ β₁ f') (Bitraversable.tfst.{u1} (fun {α₀ : Type.{u1}} {β₀ : Type.{u1}} => t α₀ β₀) _inst_1 β₀ F _inst_2 α₀ α₁ f x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.applicative.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₁)) (Functor.Comp.{u1, u1, u1} F G α₁) (Functor.Comp.mk.{u1, u1, u1} F G α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₁)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₁) (Pure.pure.{u1, u1} G (Applicative.toHasPure.{u1, u1} G _inst_3) α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₁)) (Functor.Comp.{u1, u1, u1} F G β₁) (Functor.Comp.mk.{u1, u1, u1} F G β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (F (G β₁)) (Pure.pure.{u1, u1} F (Applicative.toHasPure.{u1, u1} F _inst_2) (G β₁)) f')) x)
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α₀ : Type.{u1}} {α₁ : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} (f : α₀ -> (F α₁)) (f' : β₀ -> (G β₁)) (x : t α₀ β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α₁ β₁)) (Functor.Comp.mk.{u1, u1, u1} F G (t α₁ β₁) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α₁ β₀) (G (t α₁ β₁)) (Bitraversable.tsnd.{u1} t _inst_1 α₁ G _inst_3 β₀ β₁ f') (Bitraversable.tfst.{u1} t _inst_1 β₀ F _inst_2 α₀ α₁ f x))) (Bitraversable.bitraverse.{u1} t _inst_1 (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) α₀ α₁ β₀ β₁ (Function.comp.{succ u1, succ u1, succ u1} α₀ (F (G α₁)) (Functor.Comp.{u1, u1, u1} F G α₁) (Functor.Comp.mk.{u1, u1, u1} F G α₁) (Function.comp.{succ u1, succ u1, succ u1} α₀ (F α₁) (F (G α₁)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) α₁ (G α₁) (Pure.pure.{u1, u1} G (Applicative.toPure.{u1, u1} G _inst_3) α₁)) f)) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₁)) (Functor.Comp.{u1, u1, u1} F G β₁) (Functor.Comp.mk.{u1, u1, u1} F G β₁) (Function.comp.{succ u1, succ u1, succ u1} β₀ (G β₁) (F (G β₁)) (Pure.pure.{u1, u1} F (Applicative.toPure.{u1, u1} F _inst_2) (G β₁)) f')) x)
+Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_tfst Bitraversable.tsnd_tfstₓ'. -/
 @[higher_order.1tsnd_comp_tfst]
 theorem tsnd_tfst {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tsnd f' <$> tfst f x) = bitraverse (Comp.mk ∘ map pure ∘ f) (Comp.mk ∘ pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tsnd_tfst Bitraversable.tsnd_tfst
 
+/- warning: bitraversable.comp_tsnd -> Bitraversable.comp_tsnd is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} {β₂ : Type.{u1}} (g : β₀ -> (F β₁)) (g' : β₁ -> (G β₂)) (x : t α β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G (t α β₂)) (Functor.Comp.mk.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G (t α β₂) (Functor.map.{u1, u1} (fun {β₁ : Type.{u1}} => F β₁) (Applicative.toFunctor.{u1, u1} (fun {β₁ : Type.{u1}} => F β₁) _inst_2) (t α β₁) (G (t α β₂)) (Bitraversable.tsnd.{u1} t _inst_1 α G _inst_3 β₁ β₂ g') (Bitraversable.tsnd.{u1} t _inst_1 α (fun {β₁ : Type.{u1}} => F β₁) _inst_2 β₀ β₁ g x))) (Bitraversable.tsnd.{u1} t _inst_1 α (Functor.Comp.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G) (Functor.Comp.applicative.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G _inst_2 _inst_3) β₀ β₂ (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₂)) (Functor.Comp.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G β₂) (Functor.Comp.mk.{u1, u1, u1} (fun {β₁ : Type.{u1}} => F β₁) G β₂) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F β₁) (F (G β₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) β₁ (G β₂) g') g)) x)
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] {F : Type.{u1} -> Type.{u1}} {G : Type.{u1} -> Type.{u1}} [_inst_2 : Applicative.{u1, u1} F] [_inst_3 : Applicative.{u1, u1} G] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] [_inst_5 : LawfulApplicative.{u1, u1} F _inst_2] [_inst_6 : LawfulApplicative.{u1, u1} G _inst_3] {α : Type.{u1}} {β₀ : Type.{u1}} {β₁ : Type.{u1}} {β₂ : Type.{u1}} (g : β₀ -> (F β₁)) (g' : β₁ -> (G β₂)) (x : t α β₀), Eq.{succ u1} (Functor.Comp.{u1, u1, u1} F G (t α β₂)) (Functor.Comp.mk.{u1, u1, u1} F G (t α β₂) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) (t α β₁) (G (t α β₂)) (Bitraversable.tsnd.{u1} t _inst_1 α G _inst_3 β₁ β₂ g') (Bitraversable.tsnd.{u1} t _inst_1 α F _inst_2 β₀ β₁ g x))) (Bitraversable.tsnd.{u1} t _inst_1 α (Functor.Comp.{u1, u1, u1} F G) (Functor.Comp.instApplicativeComp.{u1, u1, u1} F G _inst_2 _inst_3) β₀ β₂ (Function.comp.{succ u1, succ u1, succ u1} β₀ (F (G β₂)) (Functor.Comp.{u1, u1, u1} F G β₂) (Functor.Comp.mk.{u1, u1, u1} F G β₂) (Function.comp.{succ u1, succ u1, succ u1} β₀ (F β₁) (F (G β₂)) (Functor.map.{u1, u1} F (Applicative.toFunctor.{u1, u1} F _inst_2) β₁ (G β₂) g') g)) x)
+Case conversion may be inaccurate. Consider using '#align bitraversable.comp_tsnd Bitraversable.comp_tsndₓ'. -/
 @[higher_order.1tsnd_comp_tsnd]
 theorem comp_tsnd {α β₀ β₁ β₂} (g : β₀ → F β₁) (g' : β₁ → G β₂) (x : t α β₀) :
     Comp.mk (tsnd g' <$> tsnd g x) = tsnd (Comp.mk ∘ map g' ∘ g) x := by
@@ -106,11 +146,23 @@ private theorem pure_eq_id_mk_comp_id {α} : pure = id.mk ∘ @id α :=
 
 open Function
 
+/- warning: bitraversable.tfst_eq_fst_id -> Bitraversable.tfst_eq_fst_id is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {α' : Type.{u1}} {β : Type.{u1}} (f : α -> α') (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α' β)) (Bitraversable.tfst.{u1} t _inst_1 β (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) α α' (Function.comp.{succ u1, succ u1, succ u1} α α' (id.{succ (succ u1)} Type.{u1} α') (id.mk.{succ u1} α') f) x) (id.mk.{succ u1} (t α' β) (Bifunctor.fst.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α α' β f x))
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {α' : Type.{u1}} {β : Type.{u1}} (f : α -> α') (x : t α β), Eq.{succ u1} (Id.{u1} (t α' β)) (Bitraversable.tfst.{u1} t _inst_1 β Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) α α' (Function.comp.{succ u1, succ u1, succ u1} α α' (Id.{u1} α') (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) α') f) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α' β) (Bifunctor.fst.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α α' β f x))
+Case conversion may be inaccurate. Consider using '#align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_idₓ'. -/
 @[higher_order.1]
 theorem tfst_eq_fst_id {α α' β} (f : α → α') (x : t α β) : tfst (id.mk ∘ f) x = id.mk (fst f x) :=
   by simp [tfst, fst, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_id
 
+/- warning: bitraversable.tsnd_eq_snd_id -> Bitraversable.tsnd_eq_snd_id is a dubious translation:
+lean 3 declaration is
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} {β' : Type.{u1}} (f : β -> β') (x : t α β), Eq.{succ u1} (id.{succ (succ u1)} Type.{u1} (t α β')) (Bitraversable.tsnd.{u1} t _inst_1 α (id.{succ (succ u1)} Type.{u1}) (Monad.toApplicative.{u1, u1} (id.{succ (succ u1)} Type.{u1}) id.monad.{u1}) β β' (Function.comp.{succ u1, succ u1, succ u1} β β' (id.{succ (succ u1)} Type.{u1} β') (id.mk.{succ u1} β') f) x) (id.mk.{succ u1} (t α β') (Bifunctor.snd.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α β β' f x))
+but is expected to have type
+  forall {t : Type.{u1} -> Type.{u1} -> Type.{u1}} [_inst_1 : Bitraversable.{u1} t] [_inst_4 : IsLawfulBitraversable.{u1} t _inst_1] {α : Type.{u1}} {β : Type.{u1}} {β' : Type.{u1}} (f : β -> β') (x : t α β), Eq.{succ u1} (Id.{u1} (t α β')) (Bitraversable.tsnd.{u1} t _inst_1 α Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1}) β β' (Function.comp.{succ u1, succ u1, succ u1} β β' (Id.{u1} β') (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) β') f) x) (Pure.pure.{u1, u1} Id.{u1} (Applicative.toPure.{u1, u1} Id.{u1} (Monad.toApplicative.{u1, u1} Id.{u1} Id.instMonadId.{u1})) (t α β') (Bifunctor.snd.{u1, u1, u1} t (Bitraversable.toBifunctor.{u1} t _inst_1) α β β' f x))
+Case conversion may be inaccurate. Consider using '#align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_idₓ'. -/
 @[higher_order.1]
 theorem tsnd_eq_snd_id {α β β'} (f : β → β') (x : t α β) : tsnd (id.mk ∘ f) x = id.mk (snd f x) :=
   by simp [tsnd, snd, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]

58581d0f

bump to nightly-2023-03-13-18

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

66e1e587

Diff

@@ -64,35 +64,35 @@ def tsnd {α α'} (f : α → F α') : t β α → F (t β α') :=
 
 variable [IsLawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
 
-@[higher_order tfst_id]
+@[higher_order.1tfst_id]
 theorem id_tfst : ∀ {α β} (x : t α β), tfst id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tfst Bitraversable.id_tfst
 
-@[higher_order tsnd_id]
+@[higher_order.1tsnd_id]
 theorem id_tsnd : ∀ {α β} (x : t α β), tsnd id.mk x = id.mk x :=
   @id_bitraverse _ _ _
 #align bitraversable.id_tsnd Bitraversable.id_tsnd
 
-@[higher_order tfst_comp_tfst]
+@[higher_order.1tfst_comp_tfst]
 theorem comp_tfst {α₀ α₁ α₂ β} (f : α₀ → F α₁) (f' : α₁ → G α₂) (x : t α₀ β) :
     Comp.mk (tfst f' <$> tfst f x) = tfst (Comp.mk ∘ map f' ∘ f) x := by
   rw [← comp_bitraverse] <;> simp [tfst, map_comp_pure, Pure.pure]
 #align bitraversable.comp_tfst Bitraversable.comp_tfst
 
-@[higher_order tfst_comp_tsnd]
+@[higher_order.1tfst_comp_tsnd]
 theorem tfst_tsnd {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tfst f <$> tsnd f' x) = bitraverse (Comp.mk ∘ pure ∘ f) (Comp.mk ∘ map pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tfst_tsnd Bitraversable.tfst_tsnd
 
-@[higher_order tsnd_comp_tfst]
+@[higher_order.1tsnd_comp_tfst]
 theorem tsnd_tfst {α₀ α₁ β₀ β₁} (f : α₀ → F α₁) (f' : β₀ → G β₁) (x : t α₀ β₀) :
     Comp.mk (tsnd f' <$> tfst f x) = bitraverse (Comp.mk ∘ map pure ∘ f) (Comp.mk ∘ pure ∘ f') x :=
   by rw [← comp_bitraverse] <;> simp [tfst, tsnd]
 #align bitraversable.tsnd_tfst Bitraversable.tsnd_tfst
 
-@[higher_order tsnd_comp_tsnd]
+@[higher_order.1tsnd_comp_tsnd]
 theorem comp_tsnd {α β₀ β₁ β₂} (g : β₀ → F β₁) (g' : β₁ → G β₂) (x : t α β₀) :
     Comp.mk (tsnd g' <$> tsnd g x) = tsnd (Comp.mk ∘ map g' ∘ g) x := by
   rw [← comp_bitraverse] <;> simp [tsnd] <;> rfl
@@ -106,12 +106,12 @@ private theorem pure_eq_id_mk_comp_id {α} : pure = id.mk ∘ @id α :=
 
 open Function
 
-@[higher_order]
+@[higher_order.1]
 theorem tfst_eq_fst_id {α α' β} (f : α → α') (x : t α β) : tfst (id.mk ∘ f) x = id.mk (fst f x) :=
   by simp [tfst, fst, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tfst_eq_fst_id Bitraversable.tfst_eq_fst_id
 
-@[higher_order]
+@[higher_order.1]
 theorem tsnd_eq_snd_id {α β β'} (f : β → β') (x : t α β) : tsnd (id.mk ∘ f) x = id.mk (snd f x) :=
   by simp [tsnd, snd, pure_eq_id_mk_comp_id, -comp.right_id, bitraverse_eq_bimap_id]
 #align bitraversable.tsnd_eq_snd_id Bitraversable.tsnd_eq_snd_id

58581d0f

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

58581d0f

chore(*): remove empty lines between variable statements (#11418)

Empty lines were removed by executing the following Python script twice

import os
import re


# Loop through each file in the repository
for dir_path, dirs, files in os.walk('.'):
  for filename in files:
    if filename.endswith('.lean'):
      file_path = os.path.join(dir_path, filename)

      # Open the file and read its contents
      with open(file_path, 'r') as file:
        content = file.read()

      # Use a regular expression to replace sequences of "variable" lines separated by empty lines
      # with sequences without empty lines
      modified_content = re.sub(r'(variable.*\n)\n(variable(?! .* in))', r'\1\2', content)

      # Write the modified content back to the file
      with open(file_path, 'w') as file:
        file.write(modified_content)

75c86f04

Diff

@@ -38,7 +38,6 @@ traversable bitraversable functor bifunctor applicative
 universe u
 
 variable {t : Type u → Type u → Type u} [Bitraversable t]
-
 variable {β : Type u}
 
 namespace Bitraversable

58581d0f

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,14 +2,11 @@
 Copyright (c) 2019 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.lemmas
-! leanprover-community/mathlib commit 58581d0fe523063f5651df0619be2bf65012a94a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Control.Bitraversable.Basic
 
+#align_import control.bitraversable.lemmas from "leanprover-community/mathlib"@"58581d0fe523063f5651df0619be2bf65012a94a"
+
 /-!
 # Bitraversable Lemmas

58581d0f

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

98c34d9e

Diff

@@ -62,7 +62,7 @@ def tsnd {α α'} (f : α → F α') : t β α → F (t β α') :=
   bitraverse pure f
 #align bitraversable.tsnd Bitraversable.tsnd
 
-variable [IsLawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
+variable [LawfulBitraversable t] [LawfulApplicative F] [LawfulApplicative G]
 
 @[higher_order tfst_id]
 theorem id_tfst : ∀ {α β} (x : t α β), tfst (F := Id) pure x = pure x :=

58581d0f

feat: port Control.Bitraversable.Lemmas (#3460)

68044747

`control.bitraversable.lemmas` ⟷ `Mathlib.Control.Bitraversable.Lemmas`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3

control.bitraversable.lemmas ⟷ Mathlib.Control.Bitraversable.Lemmas

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3

`control.bitraversable.lemmas` ⟷ `Mathlib.Control.Bitraversable.Lemmas`