Nuprl Lemma : max-fst-val
∀[Info,A,T:Type].
∀[es:EO+(Info)]. ∀[X:EClass(T × A)]. ∀[e:E].
MaxFst(X)(e) ~ accum_list(p1,e.if fst(p1) <z fst(X(e)) then X(e) else p1 fi ;e.X(e);≤(X)(e))
supposing ↑e ∈b MaxFst(X)
supposing T ⊆r ℤ
Proof
Definitions occuring in Statement :
max-fst-class: MaxFst(X),
es-interface-predecessors: ≤(X)(e),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
accum_list: accum_list(a,x.f[a; x];x.base[x];L),
assert: ↑b,
ifthenelse: if b then t else f fi ,
lt_int: i <z j,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
pi1: fst(t),
product: x:A × B[x],
int: ℤ,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
max-fst-class: MaxFst(X),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
prop: ℙ
Latex:
\mforall{}[Info,A,T:Type].
\mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(T \mtimes{} A)]. \mforall{}[e:E].
MaxFst(X)(e) \msim{} accum\_list(p1,e.if fst(p1) <z fst(X(e)) then X(e) else p1 fi ;e.X(e);\mleq{}(X)(e))
supposing \muparrow{}e \mmember{}\msubb{} MaxFst(X)
supposing T \msubseteq{}r \mBbbZ{}
Date html generated:
2016_05_16-PM-11_11_55
Last ObjectModification:
2015_12_29-AM-10_31_51
Theory : event-ordering
Home
Index