Nuprl Lemma : es-eq_wf
∀[es:EO]. (es-eq(es) ∈ EqDecider(E))
Proof
Definitions occuring in Statement :
es-eq: es-eq(es),
es-E: E,
event_ordering: EO,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-eq: es-eq(es),
deq: EqDecider(T),
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
uiff: uiff(P;Q),
uimplies: b supposing a,
prop: ℙ,
rev_implies: P ⇐ Q,
cand: A c∧ B,
not: ¬A,
squash: ↓T,
true: True,
false: False,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
guard: {T},
es-E: E,
es-base-E: es-base-E(es),
es-dom: es-dom(es)
Latex:
\mforall{}[es:EO]. (es-eq(es) \mmember{} EqDecider(E))
Date html generated:
2016_05_16-AM-09_15_19
Last ObjectModification:
2016_01_17-PM-01_31_50
Theory : new!event-ordering
Home
Index