Nuprl Lemma : memory-class1-program_wf
∀[Info,A,B:Type]. ∀[init:Id ⟶ B]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[X:EClass(A)]. ∀[pr:LocalClass(X)].
(memory-class1-program(init;f;pr) ∈ LocalClass(memory-class1(initially init
applying f
on X))) supposing
(valueall-type(B) and
(↓B))
Proof
Definitions occuring in Statement :
memory-class1-program: memory-class1-program(init;tr;pr),
memory-class1: memory-class1,
local-class: LocalClass(X),
eclass: EClass(A[eo; e]),
Id: Id,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
squash: ↓T,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
squash: ↓T,
memory-class1-program: memory-class1-program(init;tr;pr),
memory-class1: memory-class1,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
exists: ∃x:A. B[x],
prop: ℙ,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2]
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[init:Id {}\mrightarrow{} B]. \mforall{}[f:Id {}\mrightarrow{} A {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[X:EClass(A)]. \mforall{}[pr:LocalClass(X)].
(memory-class1-program(init;f;pr) \mmember{} LocalClass(memory-class1(initially init
applying f
on X))) supposing
(valueall-type(B) and
(\mdownarrow{}B))
Date html generated:
2016_05_17-AM-09_11_36
Last ObjectModification:
2016_01_17-PM-09_12_13
Theory : local!classes
Home
Index