Nuprl Lemma : prior-latest-val
∀[Info,T:Type]. ∀[X:EClass(T)]. (((X)-)' = (X)' ∈ EClass(T))
Proof
Definitions occuring in Statement :
es-latest-val: (X)-,
es-prior-val: (X)',
eclass: EClass(A[eo; e]),
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
sv-class: Singlevalued(X),
all: ∀x:A. B[x],
es-prior-val: (X)',
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
iff: P ⇐⇒ Q,
cand: A c∧ B,
so_lambda: λ2x.t[x],
so_apply: x[s],
rev_implies: P ⇐ Q,
es-locl: (e <loc e'),
squash: ↓T,
decidable: Dec(P),
es-le: e ≤loc e'
Latex:
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. (((X)\msupminus{})' = (X)')
Date html generated:
2016_05_17-AM-08_10_17
Last ObjectModification:
2016_01_17-PM-02_44_21
Theory : event-ordering
Home
Index