Nuprl Lemma : es-interval-eq
∀[es:EO]. ∀[e:E]. ([e, e] ~ [e])
Proof
Definitions occuring in Statement :
es-interval: [e, e'],
es-E: E,
event_ordering: EO,
cons: [a / b],
nil: [],
uall: ∀[x:A]. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-interval: [e, e'],
uimplies: b supposing a,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
not: ¬A,
false: False,
guard: {T},
or: P ∨ Q,
cons: [a / b],
top: Top,
subtype_rel: A ⊆r B,
append: as @ bs,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3],
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. ([e, e] \msim{} [e])
Date html generated:
2016_05_16-AM-09_33_06
Last ObjectModification:
2015_12_28-PM-09_47_15
Theory : new!event-ordering
Home
Index