Nuprl Lemma : iseg-local-simulation-inputs
∀f:Name ⟶ Type
∀[Info:Type]
∀es:EO+(Message(f)). ∀hdr:Name. ∀locs:bag(Id).
∀e1,e2:E. (e1 ≤loc e2 ⇒ local-simulation-inputs(es;e1;hdr;locs) ≤ local-simulation-inputs(es;e2;hdr;locs))
supposing hdr encodes Id × Info
Proof
Definitions occuring in Statement :
local-simulation-inputs: local-simulation-inputs(es;e;hdr;locs),
encodes-msg-type: hdr encodes T,
Message: Message(f),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-E: E,
Id: Id,
name: Name,
iseg: l1 ≤ l2,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
encodes-msg-type: hdr encodes T,
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
local-simulation-inputs: local-simulation-inputs(es;e;hdr;locs),
prop: ℙ,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
top: Top,
iff: P ⇐⇒ Q,
and: P ∧ Q,
msg-type: msg-type(msg;f),
rev_implies: P ⇐ Q
Latex:
\mforall{}f:Name {}\mrightarrow{} Type
\mforall{}[Info:Type]
\mforall{}es:EO+(Message(f)). \mforall{}hdr:Name. \mforall{}locs:bag(Id).
\mforall{}e1,e2:E.
(e1 \mleq{}loc e2
{}\mRightarrow{} local-simulation-inputs(es;e1;hdr;locs) \mleq{} local-simulation-inputs(es;e2;hdr;locs))
supposing hdr encodes Id \mtimes{} Info
Date html generated:
2016_05_17-AM-08_53_21
Last ObjectModification:
2015_12_29-PM-02_57_21
Theory : messages
Home
Index