Nuprl Lemma : strong-message-constraint-no-rep-implies
∀[f:Name ⟶ Type]. ∀[es:EO+(Message(f))]. ∀[X:EClass(Id × Message(f))]. ∀[hdrs:Name List].
(strong-message-constraint-no-rep{i:l}(es;X;hdrs;f) ⇒ strong-message-constraint{i:l}(es;X;hdrs;f))
Proof
Definitions occuring in Statement :
strong-message-constraint-no-rep: strong-message-constraint-no-rep{i:l}(es;X;hdrs;f),
strong-message-constraint: strong-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 :
strong-message-constraint: strong-message-constraint{i:l}(es;X;hdrs;f),
strong-message-constraint-no-rep: strong-message-constraint-no-rep{i:l}(es;X;hdrs;f),
all: ∀x:A. B[x],
member: t ∈ T,
squash: ↓T,
exists: ∃x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
prop: ℙ,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
so_apply: x[s],
uimplies: b supposing a,
label: ...$L... t
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\{i:l\}(es;X;hdrs;f)
{}\mRightarrow{} strong-message-constraint\{i:l\}(es;X;hdrs;f))
Date html generated:
2016_05_17-AM-08_55_43
Last ObjectModification:
2016_01_17-PM-08_32_36
Theory : messages
Home
Index