Nuprl Lemma : es-interval-one-one
∀[es:EO]. ∀[d,b,a,c:E].
({(a = c ∈ E) ∧ (b = d ∈ E)}) supposing (([a, b] = [c, d] ∈ (E List)) and c ≤loc d and a ≤loc b )
Proof
Definitions occuring in Statement :
es-interval: [e, e'],
es-le: e ≤loc e' ,
es-E: E,
event_ordering: EO,
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
guard: {T},
and: P ∧ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
guard: {T},
and: P ∧ Q,
prop: ℙ,
not: ¬A,
implies: P ⇒ Q,
all: ∀x:A. B[x],
false: False,
iff: P ⇐⇒ Q,
cand: A c∧ B,
squash: ↓T,
true: True
Latex:
\mforall{}[es:EO]. \mforall{}[d,b,a,c:E].
(\{(a = c) \mwedge{} (b = d)\}) supposing (([a, b] = [c, d]) and c \mleq{}loc d and a \mleq{}loc b )
Date html generated:
2016_05_16-AM-09_33_32
Last ObjectModification:
2016_01_17-PM-01_29_43
Theory : new!event-ordering
Home
Index