14 lines
561 B
Text
14 lines
561 B
Text
import logic data.nat.basic
|
|
open nat
|
|
|
|
inductive vector (A : Type) : nat → Type :=
|
|
vnil : vector A zero,
|
|
vcons : Π {n : nat}, A → vector A n → vector A (succ n)
|
|
|
|
namespace vector
|
|
theorem vcons.inj₁ {A : Type} {n : nat} (a₁ a₂ : A) (v₁ v₂ : vector A n) : vcons a₁ v₁ = vcons a₂ v₂ → a₁ = a₂ :=
|
|
assume h, no_confusion h (λ n h t, h)
|
|
|
|
theorem vcons.inj₂ {A : Type} {n : nat} (a₁ a₂ : A) (v₁ v₂ : vector A n) : vcons a₁ v₁ = vcons a₂ v₂ → v₁ == v₂ :=
|
|
assume h, no_confusion h (λ n h t, t)
|
|
end vector
|