Nuprl Lemma : assert-es-first-locl
∀[es:EO]. ∀[e:E]. uiff(↑first(e);∀[e':E]. ¬(e' <loc e) supposing loc(e') = loc(e) ∈ Id)
Proof
Definitions occuring in Statement :
es-locl: (e <loc e'),
es-first: first(e),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
assert: ↑b,
uiff: uiff(P;Q),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
equal: s = t ∈ T
Definitions unfolded in proof :
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
uall: ∀[x:A]. B[x],
not: ¬A,
implies: P ⇒ Q,
false: False,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
es-locl: (e <loc e'),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
guard: {T}
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. uiff(\muparrow{}first(e);\mforall{}[e':E]. \mneg{}(e' <loc e) supposing loc(e') = loc(e))
Date html generated:
2016_05_16-AM-10_36_55
Last ObjectModification:
2015_12_28-PM-09_14_35
Theory : new!event-ordering
Home
Index