Documentation

Std.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap

theorem Std.IterM.stepAsHetT_filterMapWithPostcondition {m : Type u_1 → Type u_2} {n : Type u_1 → Type u_3} {α β γ : Type u_1} [Monad m] [LawfulMonad m] [Monad n] [LawfulMonad n] [Iterator α m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → Iterators.PostconditionT n (Option γ)} {it : IterM m β} :
theorem Std.IterM.Equiv.filterMapWithPostcondition {α₁ α₂ β γ : Type w} {m : Type w → Type w'} {n : Type w → Type w''} [Monad m] [LawfulMonad m] [Monad n] [LawfulMonad n] [Iterator α₁ m β] [Iterator α₂ m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → Iterators.PostconditionT n (Option γ)} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.filterWithPostcondition {α₁ α₂ β : Type w} {m : Type w → Type w'} {n : Type w → Type w''} [Monad m] [LawfulMonad m] [Monad n] [LawfulMonad n] [Iterator α₁ m β] [Iterator α₂ m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → Iterators.PostconditionT n (ULift Bool)} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.mapWithPostcondition {α₁ α₂ β γ : Type w} {m : Type w → Type w'} {n : Type w → Type w''} [Monad m] [LawfulMonad m] [Monad n] [LawfulMonad n] [Iterator α₁ m β] [Iterator α₂ m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → Iterators.PostconditionT n γ} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.filterMapM {α₁ α₂ β γ : Type w} {m : Type w → Type w'} {n : Type w → Type w''} [Monad m] [LawfulMonad m] [Monad n] [MonadAttach n] [LawfulMonad n] [Iterator α₁ m β] [Iterator α₂ m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → n (Option γ)} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.filterM {α₁ α₂ β : Type w} {m : Type w → Type w'} {n : Type w → Type w''} [Monad m] [LawfulMonad m] [Monad n] [MonadAttach n] [LawfulMonad n] [Iterator α₁ m β] [Iterator α₂ m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → n (ULift Bool)} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.mapM {α₁ α₂ β γ : Type w} {m : Type w → Type w'} {n : Type w → Type w''} [Monad m] [LawfulMonad m] [Monad n] [MonadAttach n] [LawfulMonad n] [Iterator α₁ m β] [Iterator α₂ m β] [MonadLiftT m n] [LawfulMonadLiftT m n] {f : β → n γ} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
(IterM.mapM f ita).Equiv (IterM.mapM f itb)
theorem Std.IterM.Equiv.filterMap {α₁ α₂ β γ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Iterator α₁ m β] [Iterator α₂ m β] {f : β → Option γ} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.filter {α₁ α₂ β : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Iterator α₁ m β] [Iterator α₂ m β] {f : β → Bool} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
theorem Std.IterM.Equiv.map {α₁ α₂ β γ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Iterator α₁ m β] [Iterator α₂ m β] {f : β → γ} {ita : IterM m β} {itb : IterM m β} (h : ita.Equiv itb) :
(IterM.map f ita).Equiv (IterM.map f itb)