Nuprl Lemma : es-init-eq
∀[es:EO]. ∀[e,e':E]. es-init(es;e) = es-init(es;e') ∈ E supposing loc(e) = loc(e') ∈ Id
Proof
Definitions occuring in Statement :
es-init: es-init(es;e),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
or: P ∨ Q,
wellfounded: WellFnd{i}(A;x,y.R[x; y]),
guard: {T},
not: ¬A,
false: False,
es-E: E,
es-base-E: es-base-E(es),
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
squash: ↓T,
true: True
Latex:
\mforall{}[es:EO]. \mforall{}[e,e':E]. es-init(es;e) = es-init(es;e') supposing loc(e) = loc(e')
Date html generated:
2016_05_16-AM-09_39_57
Last ObjectModification:
2016_01_17-PM-01_26_11
Theory : new!event-ordering
Home
Index