Nuprl Lemma : assert-es-eq-E-base
∀[es:EO]. ∀[e,e':es-base-E(es)]. uiff(e = e' ∈ es-base-E(es);↑e = e')
Proof
Definitions occuring in Statement :
es-eq-E: e = e',
es-base-E: es-base-E(es),
event_ordering: EO,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-eq-E: e = e',
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
rev_implies: P ⇐ Q,
subtype_rel: A ⊆r B,
guard: {T},
deq: EqDecider(T),
implies: P ⇒ Q,
iff: P ⇐⇒ Q
Latex:
\mforall{}[es:EO]. \mforall{}[e,e':es-base-E(es)]. uiff(e = e';\muparrow{}e = e')
Date html generated:
2016_05_16-AM-09_15_45
Last ObjectModification:
2015_12_28-PM-09_57_21
Theory : new!event-ordering
Home
Index