Nuprl Lemma : base-process-inputs-non-null
∀[f:Name ⟶ Type]. ∀[Info,T:Type]. ∀[X:EClass(T)]. ∀[loc:Id]. ∀[hdr:Name].
∀[es:EO+(Message(f))]. ∀[e:E].
0 < ||base-process-inputs(loc;hdr;es;e)|| supposing ↑test-msg-header-and-loc(info(e);hdr;loc)
supposing hdr encodes Id × Info
Proof
Definitions occuring in Statement :
base-process-inputs: base-process-inputs(loc;hdr;es;e),
test-msg-header-and-loc: test-msg-header-and-loc(msg;hdr;loc),
encodes-msg-type: hdr encodes T,
Message: Message(f),
eclass: EClass(A[eo; e]),
es-info: info(e),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
name: Name,
length: ||as||,
assert: ↑b,
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
product: x:A × B[x],
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
base-process-inputs: base-process-inputs(loc;hdr;es;e),
member: t ∈ T,
top: Top,
subtype_rel: A ⊆r B,
encodes-msg-type: hdr encodes T,
all: ∀x:A. B[x],
prop: ℙ,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
exists: ∃x:A. B[x],
cand: A c∧ B
Latex:
\mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[loc:Id]. \mforall{}[hdr:Name].
\mforall{}[es:EO+(Message(f))]. \mforall{}[e:E].
0 < ||base-process-inputs(loc;hdr;es;e)|| supposing \muparrow{}test-msg-header-and-loc(info(e);hdr;loc)
supposing hdr encodes Id \mtimes{} Info
Date html generated:
2016_05_17-AM-08_52_46
Last ObjectModification:
2015_12_29-PM-02_57_00
Theory : messages
Home
Index