Nuprl Lemma : single-valued-base-loc-classrel
∀[f:Name ⟶ Type]. ∀[T:Type]. ∀[es:EO+(Message(f))]. ∀[e:E]. ∀[v1,v2:T]. ∀[hdr:Name].
∀[locs:bag(Id)]. (v1 ∈ Base(hdr;locs)(e) ⇒ v2 ∈ Base(hdr;locs)(e) ⇒ (v1 = v2 ∈ T)) supposing T = (f hdr) ∈ Type
Proof
Definitions occuring in Statement :
base-headers-msg-val-loc: Base(hdr;locs),
Message: Message(f),
classrel: v ∈ X(e),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
name: Name,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T,
bag: bag(T)
Definitions unfolded in proof :
base-headers-msg-val-loc: Base(hdr;locs),
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
encodes-msg-type: hdr encodes T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
uiff: uiff(P;Q),
has-es-info-type: has-es-info-type(es;e;f;T),
name: Name,
sq_type: SQType(T),
guard: {T},
prop: ℙ
Latex:
\mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[T:Type]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E]. \mforall{}[v1,v2:T]. \mforall{}[hdr:Name].
\mforall{}[locs:bag(Id)]. (v1 \mmember{} Base(hdr;locs)(e) {}\mRightarrow{} v2 \mmember{} Base(hdr;locs)(e) {}\mRightarrow{} (v1 = v2))
supposing T = (f hdr)
Date html generated:
2016_05_17-AM-09_28_30
Last ObjectModification:
2015_12_29-PM-04_02_08
Theory : classrel!lemmas
Home
Index