array 1 Doc

array_seg Def a[i..j] == < i,j,2of(2of(a)) >

Thm* i:, j:{i...}, a:[T]Array{i..j}, m:{i..j}, n:{m..j}. a[m..n] [T]Array{m..n}

array Def [T]Array == n:m:{n...}{n..m}T

Thm* T:Type{i}. [T]Array Type{[i']}

int_upper Def {i...} == {j:| ij}

Thm* n:. {n...} Type

array_ub Def a.u == 1of(2of(a))

Thm* a:[T]Array . a.u

array_lb Def a.l == 1of(a)

Thm* a:[T]Array . a.l

int_seg Def {i..j} == {k:| i k < j}

Thm* m,n:. {m..n} Type

pi2 Def 2of(t) == t.2

Thm* B:(AType), p:a:AB(a). 2of(p) B(1of(p))

function_primDef x:AB(x) == PRIMITIVE {Total functions from A: x.b(x) such that b(x) B(x) for x A }

lelt Def i j < k == ij & j < k

le Def AB == B < A

Thm* i,j:. ij Prop

pi1 Def 1of(t) == t.1

Thm* B:(AType), p:a:AB(a). 1of(p) A

not Def A == A False

Thm* (A) Prop