Nuprl Lemma : strong-message-constraint-no-rep-large-implies
∀[f:Name ⟶ Type]. ∀[es:EO+(Message(f))]. ∀[X:EClass(Id × Message(f))]. ∀[hdrs:Name List].
  (strong-message-constraint-no-rep-large{i:l}(es;X;hdrs;f) 
⇒ message-constraint{i:l}(es;X;hdrs;f))
Proof
Definitions occuring in Statement : 
strong-message-constraint-no-rep-large: strong-message-constraint-no-rep-large{i:l}(es;X;hdrs;f)
, 
message-constraint: message-constraint{i:l}(es;X;hdrs;f)
, 
Message: Message(f)
, 
eclass: EClass(A[eo; e])
, 
event-ordering+: EO+(Info)
, 
Id: Id
, 
name: Name
, 
list: T List
, 
uall: ∀[x:A]. B[x]
, 
implies: P 
⇒ Q
, 
function: x:A ⟶ B[x]
, 
product: x:A × B[x]
, 
universe: Type
Definitions unfolded in proof : 
message-constraint: message-constraint{i:l}(es;X;hdrs;f)
, 
strong-message-constraint-no-rep-large: strong-message-constraint-no-rep-large{i:l}(es;X;hdrs;f)
, 
all: ∀x:A. B[x]
, 
member: t ∈ T
, 
squash: ↓T
, 
exists: ∃x:A. B[x]
, 
and: P ∧ Q
, 
delivered-with-headers: delivered-with-headers(hdrs;es;e)
, 
es-le-before: ≤loc(e)
, 
uall: ∀[x:A]. B[x]
, 
top: Top
, 
subtype_rel: A ⊆r B
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
implies: P 
⇒ Q
, 
uimplies: b supposing a
, 
true: True
, 
prop: ℙ
, 
assert: ↑b
, 
ifthenelse: if b then t else f fi 
, 
btrue: tt
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
sq_type: SQType(T)
, 
guard: {T}
, 
label: ...$L... t
, 
bag-append: as + bs
, 
single-bag: {x}
, 
uiff: uiff(P;Q)
, 
cand: A c∧ B
Latex:
\mforall{}[f:Name  {}\mrightarrow{}  Type].  \mforall{}[es:EO+(Message(f))].  \mforall{}[X:EClass(Id  \mtimes{}  Message(f))].  \mforall{}[hdrs:Name  List].
    (strong-message-constraint-no-rep-large\{i:l\}(es;X;hdrs;f)  {}\mRightarrow{}  message-constraint\{i:l\}(es;X;hdrs;f))
Date html generated:
2016_05_17-AM-08_55_55
Last ObjectModification:
2016_01_17-PM-08_33_06
Theory : messages
Home
Index