Nuprl Lemma : es-last-event_wf
∀[es:EO]. ∀[e:E]. ∀[P:{e':E| e' ≤loc e } ⟶ 𝔹].
(es-last-event(es;P;e) ∈ (∃e':{E| (e' ≤loc e ∧ (↑(P e')) ∧ (∀e'':E. ((e' <loc e'') ⇒ e'' ≤loc e ⇒ (¬↑(P e'')))))})
∨ (¬(∃e':{E| (e' ≤loc e ∧ (↑(P e')))})))
Proof
Definitions occuring in Statement :
es-last-event: es-last-event(es;P;e),
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
es-E: E,
event_ordering: EO,
assert: ↑b,
bool: 𝔹,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
sq_exists: ∃x:{A| B[x]},
not: ¬A,
implies: P ⇒ Q,
or: P ∨ Q,
and: P ∧ Q,
member: t ∈ T,
set: {x:A| B[x]} ,
apply: f a,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
subtype_rel: A ⊆r B,
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
es-last-event: es-last-event(es;P;e),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
cand: A c∧ B,
sq_exists: ∃x:{A| B[x]},
so_lambda: λ2x.t[x],
so_apply: x[s],
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
es-locl: (e <loc e'),
es-le: e ≤loc e' ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. \mforall{}[P:\{e':E| e' \mleq{}loc e \} {}\mrightarrow{} \mBbbB{}].
(es-last-event(es;P;e) \mmember{} (\mexists{}e':\{E| (e' \mleq{}loc e
\mwedge{} (\muparrow{}(P e'))
\mwedge{} (\mforall{}e'':E. ((e' <loc e'') {}\mRightarrow{} e'' \mleq{}loc e {}\mRightarrow{} (\mneg{}\muparrow{}(P e'')))))\})
\mvee{} (\mneg{}(\mexists{}e':\{E| (e' \mleq{}loc e \mwedge{} (\muparrow{}(P e')))\})))
Date html generated:
2016_05_16-AM-09_24_14
Last ObjectModification:
2016_01_17-PM-01_33_37
Theory : new!event-ordering
Home
Index