Nuprl - Some Definitions

Thms relation autom Sections AutomataTheory Doc

biject	`Def Bij(A; B; f) == Inj(A; B; f) & Surj(A; B; f)` `Thm* A,B:Type, f:(AB). Bij(A; B; f) Prop`
decidable	`Def Dec(P) == P P` `Thm* A:Prop. Dec(A) Prop`
equiv_rel	`Def EquivRel x,y:T. E(x;y) == Refl(T;x,y.E(x;y)) & Sym x,y:T. E(x;y) & Trans x,y:T. E(x;y)` `Thm* T:Type, E:(TTProp). (EquivRel x,y:T. E(x,y)) Prop`
int_seg	`Def {i..j} == {k:\| i k < j }` `Thm* m,n:. {m..n} Type`
int_upper	`Def {i...} == {j:\| ij }` `Thm* n:. {n...} Type`
one_one_corr	`Def A ~ B == f:(AB), g:(BA). InvFuns(A; B; f; g)` `Thm* A,B:Type. (A ~ B) Prop`
preima_of_rel	`Def R_f(x,y) == (f(x)) R (f(y))` `Thm* A,B:Type, f:(AB), R:(BBProp). R_f AAProp`
surject	`Def Surj(A; B; f) == b:B. a:A. f(a) = b` `Thm* A,B:Type, f:(AB). Surj(A; B; f) Prop`
inject	`Def Inj(A; B; f) == a1,a2:A. f(a1) = f(a2) B a1 = a2` `Thm* A,B:Type, f:(AB). Inj(A; B; f) Prop`
lelt	`Def i j < k == ij & j < k`
le	`Def AB == B < A` `Thm* i,j:. ij Prop`
not	`Def A == A False` `Thm* A:Prop. (A) Prop`
trans	`Def Trans x,y:T. E(x;y) == a,b,c:T. E(a;b) E(b;c) E(a;c)` `Thm* T:Type, E:(TTProp). Trans x,y:T. E(x,y) Prop`
sym	`Def Sym x,y:T. E(x;y) == a,b:T. E(a;b) E(b;a)` `Thm* T:Type, E:(TTProp). Sym x,y:T. E(x,y) Prop`
refl	`Def Refl(T;x,y.E(x;y)) == a:T. E(a;a)` `Thm* T:Type, E:(TTProp). Refl(T;x,y.E(x,y)) Prop`
inv_funs	`Def InvFuns(A; B; f; g) == g o f = Id & f o g = Id` `Thm* A,B:Type, f:(AB), g:(BA). InvFuns(A; B; f; g) Prop`
tidentity	`Def Id == Id` `Thm* A:Type. Id AA`
compose	`Def (f o g)(x) == f(g(x))` `Thm* A,B,C:Type, f:(BC), g:(AB). f o g AC`
identity	`Def Id(x) == x` `Thm* A:Type. Id AA`

About: