Nuprl Lemma : es-closed-open-interval-decomp-last
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e1,e2:E]. [e1;e2) = ([e1;pred(e2)) @ [pred(e2)]) ∈ (E List) supposing (e1 <loc e2)
Proof
Definitions occuring in Statement :
event-ordering+: EO+(Info),
es-closed-open-interval: [e;e'),
es-locl: (e <loc e'),
es-pred: pred(e),
es-E: E,
append: as @ bs,
cons: [a / b],
nil: [],
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
guard: {T},
implies: P ⇒ Q,
not: ¬A,
false: False,
prop: ℙ,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
top: Top,
sq_type: SQType(T),
ifthenelse: if b then t else f fi ,
bfalse: ff,
es-le: e ≤loc e' ,
or: P ∨ Q,
true: True,
squash: ↓T
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2:E].
[e1;e2) = ([e1;pred(e2)) @ [pred(e2)]) supposing (e1 <loc e2)
Date html generated:
2016_05_16-PM-01_12_31
Last ObjectModification:
2016_01_17-PM-07_56_24
Theory : event-ordering
Home
Index