Nuprl Lemma : base-noloc-classrel-make-Msg2
∀[T:Type]. ∀[f:Name ⟶ Type]. ∀[es:EO+(Message(f))]. ∀[e:E]. ∀[hdr:Name]. ∀[v:T].
uiff(v ∈ Base(hdr)(e);info(e) = mk-msg(msg-authentic(info(e));hdr;v) ∈ Message(f)) supposing T = (f hdr) ∈ Type
Proof
Definitions occuring in Statement :
mk-msg: mk-msg(auth;hdr;val),
base-headers-msg-val: Base(hdr),
msg-authentic: msg-authentic(m),
Message: Message(f),
classrel: v ∈ X(e),
es-info: info(e),
event-ordering+: EO+(Info),
es-E: E,
name: Name,
uiff: uiff(P;Q),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
guard: {T},
squash: ↓T,
prop: ℙ,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
encodes-msg-type: hdr encodes T,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs
Latex:
\mforall{}[T:Type]. \mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E]. \mforall{}[hdr:Name]. \mforall{}[v:T].
uiff(v \mmember{} Base(hdr)(e);info(e) = mk-msg(msg-authentic(info(e));hdr;v)) supposing T = (f hdr)
Date html generated:
2016_05_17-AM-09_13_02
Last ObjectModification:
2016_01_17-PM-11_15_05
Theory : classrel!lemmas
Home
Index