Nuprl Lemma : es-closed-open-interval-nil
∀es:EO. ∀e:E. ([e;e) = [] ∈ (E List))
Proof
Definitions occuring in Statement :
es-closed-open-interval: [e;e'),
es-E: E,
event_ordering: EO,
nil: [],
list: T List,
all: ∀x:A. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
rev_uimplies: rev_uimplies(P;Q),
uimplies: b supposing a,
es-closed-open-interval: [e;e'),
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
not: ¬A,
false: False
Latex:
\mforall{}es:EO. \mforall{}e:E. ([e;e) = [])
Date html generated:
2016_05_16-AM-09_32_02
Last ObjectModification:
2015_12_28-PM-09_47_51
Theory : new!event-ordering
Home
Index