Documentation

LeanSubst.Types.List

def LeanSubst.List.rmap {S : Type u1} {V : List (Type u2)} [RenMap S V] (r : RenVec V) :
List S → List S
Equations
Instances For
    @[instance_reducible]
    instance LeanSubst.instRenMapList {S : Type u1} {V : List (Type u2)} [RenMap S V] :
    RenMap (List S) V
    Equations
    @[simp]
    theorem LeanSubst.List.rmap_nil {S : Type u1} {V : List (Type u2)} [RenMap S V] {r : RenVec V} :
    @[simp]
    theorem LeanSubst.List.rmap_cons {S : Type u1} {V : List (Type u2)} [RenMap S V] {x : S} {xs : List S} {r : RenVec V} :
    instance LeanSubst.instRenMapIdList {S : Type u1} {V : List (Type u2)} [RenMap S V] [RenMapId S V] :
    @[simp]
    theorem LeanSubst.List.rmap_append {S : Type u1} {V : List (Type u2)} [RenMap S V] {xs ys : List S} {r : RenVec V} :
    (xs ++ ys)⟨r,⟩ = xs⟨r,⟩ ++ ys⟨r,⟩
    @[simp]
    theorem LeanSubst.List.rmap_get? {S : Type u1} {V : List (Type u2)} [RenMap S V] {x : List S} {n : Nat} {r : RenVec V} :
    theorem LeanSubst.List.rmap_length {S : Type u1} {V : List (Type u2)} [RenMap S V] {x : List S} {r : RenVec V} :
    def LeanSubst.List.smap {S : Type u1} {V : List (Type u2)} [SubstMap S V] (σ : SubstVec V) :
    List S → List S
    Equations
    Instances For
      @[instance_reducible]
      instance LeanSubst.instSubstMapList {S : Type u1} {V : List (Type u2)} [SubstMap S V] :
      Equations
      @[simp]
      theorem LeanSubst.List.smap_none {S : Type u1} {V : List (Type u2)} [SubstMap S V] {σ : SubstVec V} :
      @[simp]
      theorem LeanSubst.List.smap_some {S : Type u1} {V : List (Type u2)} [SubstMap S V] {x : S} {xs : List S} {σ : SubstVec V} :
      (x :: xs)[σ,] = x[σ,] :: xs[σ,]