Nuprl Lemma : cond-msg-body-sv-bag-only
∀[f:Name ⟶ Type]. ∀[hdr:Name]. ∀[es:EO+(Message(f))]. ∀[e:E]. ∀[T:Type].
(sv-bag-only(cond-msg-body(hdr;info(e))) ∈ T) supposing ((header(e) = hdr ∈ Name) and hdr encodes T)
Proof
Definitions occuring in Statement :
cond-msg-body: cond-msg-body(hdr;msg)
,
encodes-msg-type: hdr encodes T
,
es-header: header(e)
,
Message: Message(f)
,
es-info: info(e)
,
event-ordering+: EO+(Info)
,
es-E: E
,
name: Name
,
uimplies: b supposing a
,
uall: ∀[x:A]. B[x]
,
member: t ∈ T
,
function: x:A ⟶ B[x]
,
universe: Type
,
equal: s = t ∈ T
,
sv-bag-only: sv-bag-only(b)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x]
,
member: t ∈ T
,
uimplies: b supposing a
,
cond-msg-body: cond-msg-body(hdr;msg)
,
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
,
less_than: a < b
,
squash: ↓T
,
less_than': less_than'(a;b)
,
true: True
,
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{}[hdr:Name]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E]. \mforall{}[T:Type].
(sv-bag-only(cond-msg-body(hdr;info(e))) \mmember{} T) supposing ((header(e) = hdr) and hdr encodes T)
Date html generated:
2016_05_17-AM-08_52_16
Last ObjectModification:
2016_01_17-PM-08_35_19
Theory : messages
Home
Index