Nuprl Lemma : es-first-init
∀[es:EO]. ∀[e:E]. (first(es-init(es;e)) ~ tt)
Proof
Definitions occuring in Statement :
es-init: es-init(es;e),
es-first: first(e),
es-E: E,
event_ordering: EO,
btrue: tt,
uall: ∀[x:A]. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
sq_type: SQType(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
es-init: es-init(es;e),
final-iterate: final-iterate(f;x),
do-apply: do-apply(f;x),
can-apply: can-apply(f;x),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
isl: isl(x),
outl: outl(x),
assert: ↑b,
iff: P ⇐⇒ Q,
true: True,
prop: ℙ,
rev_implies: P ⇐ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
wellfounded: WellFnd{i}(A;x,y.R[x; y])
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. (first(es-init(es;e)) \msim{} tt)
Date html generated:
2016_05_16-AM-09_39_32
Last ObjectModification:
2015_12_28-PM-09_59_37
Theory : new!event-ordering
Home
Index