Nuprl Lemma : base-process-inputs_wf
∀[f:Name ⟶ Type]. ∀[Info,T:Type]. ∀[X:EClass(T)]. ∀[loc:Id]. ∀[hdr:Name].
∀[es:EO+(Message(f))]. ∀[e:E]. (base-process-inputs(loc;hdr;es;e) ∈ Info List) supposing hdr encodes Id × Info
Proof
Definitions occuring in Statement :
base-process-inputs: base-process-inputs(loc;hdr;es;e),
encodes-msg-type: hdr encodes T,
Message: Message(f),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
name: Name,
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
base-process-inputs: base-process-inputs(loc;hdr;es;e),
encodes-msg-type: hdr encodes T,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
prop: ℙ,
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uiff: uiff(P;Q),
and: P ∧ Q,
msg-type: msg-type(msg;f),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
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]. (base-process-inputs(loc;hdr;es;e) \mmember{} Info List)
supposing hdr encodes Id \mtimes{} Info
Date html generated:
2016_05_17-AM-08_52_40
Last ObjectModification:
2015_12_29-PM-02_55_43
Theory : messages
Home
Index