Nuprl Lemma : eclass1-program_wf
∀[Info,B,C:Type].
∀[X:EClass(B)]. ∀[f:Id ─→ B ─→ C]. ∀[pr:LocalClass(X)]. (eclass1-program(f;pr) ∈ LocalClass((f o X)))
supposing valueall-type(C)
Proof
Definitions occuring in Statement :
eclass1-program: eclass1-program(f;pr),
eclass1: (f o X),
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],
member: t ∈ T,
function: x:A ─→ B[x],
universe: Type
Lemmas :
hdf-compose1_wf,
es-E_wf,
event-ordering+_subtype,
all_wf,
equal_wf,
bag_wf,
class-ap_wf,
eclass1_wf,
hdf-ap_wf,
iterate-hdataflow_wf,
es-loc_wf,
map_wf,
es-info_wf,
es-before_wf,
hdataflow_wf,
local-class_wf,
Id_wf,
eclass_wf,
event-ordering+_wf,
valueall-type_wf,
bag-map_wf,
squash_wf,
true_wf,
iff_weakening_equal,
list_wf,
list_induction,
hdataflow-ext,
unit_wf2,
iter_hdf_nil_lemma,
valueall-type-has-valueall,
bag-valueall-type,
evalall-reduce,
bag_map_empty_lemma,
empty-bag_wf,
iter_hdf_cons_lemma,
subtype_rel_list,
top_wf,
iterate-hdf-halt
Latex:
\mforall{}[Info,B,C:Type].
\mforall{}[X:EClass(B)]. \mforall{}[f:Id {}\mrightarrow{} B {}\mrightarrow{} C]. \mforall{}[pr:LocalClass(X)].
(eclass1-program(f;pr) \mmember{} LocalClass((f o X)))
supposing valueall-type(C)
Date html generated:
2015_07_22-PM-00_01_43
Last ObjectModification:
2015_02_04-PM-05_12_29
Home
Index