Nuprl Lemma : classfun-res-base
∀[f:Name ⟶ Type]. ∀[es:EO+(Message(f))]. ∀[e:E]. ∀[hdr:Name]. Base(hdr)@e ~ msgval(e) supposing header(e) = hdr ∈ Name
Proof
Definitions occuring in Statement :
base-headers-msg-val: Base(hdr),
es-info-body: msgval(e),
es-header: header(e),
Message: Message(f),
classfun-res: X@e,
event-ordering+: EO+(Info),
es-E: E,
name: Name,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type,
sqequal: s ~ t,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
base-headers-msg-val: Base(hdr),
classfun-res: X@e,
cond-msg-body: cond-msg-body(hdr;msg),
classfun: X(e),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
top: Top,
es-info-body: msgval(e),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
es-header: header(e),
subtype_rel: A ⊆r B
Latex:
\mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E]. \mforall{}[hdr:Name].
Base(hdr)@e \msim{} msgval(e) supposing header(e) = hdr
Date html generated:
2016_05_17-AM-11_15_40
Last ObjectModification:
2015_12_29-PM-05_12_11
Theory : process-model
Home
Index