Nuprl Lemma : es-first-at-exists
∀es:EO. ∀i:Id.
∀[P:{e:E| loc(e) = i ∈ Id} ⟶ ℙ]
((∀e:{e:E| loc(e) = i ∈ Id} . Dec(P[e]))
⇒ (∀e:E. P[e] ⇒ (∃e':E. (e' ≤loc e ∧ e' is first@ i s.t. e.P[e])) supposing loc(e) = i ∈ Id))
Proof
Definitions occuring in Statement :
es-first-at: e is first@ i s.t. e.P[e],
es-le: e ≤loc e' ,
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
decidable: Dec(P),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
top: Top,
prop: ℙ,
decidable: Dec(P),
or: P ∨ Q,
subtype_rel: A ⊆r B,
le: A ≤ B,
less_than': less_than'(a;b),
nat: ℕ,
ge: i ≥ j ,
less_than: a < b,
squash: ↓T,
so_apply: x[s],
so_lambda: λ2x.t[x],
alle-at: ∀e@i.P[e],
existse-before: ∃e<e'.P[e],
cand: A c∧ B,
es-locl: (e <loc e'),
es-first-at: e is first@ i s.t. e.P[e],
alle-lt: ∀e<e'.P[e]
Latex:
\mforall{}es:EO. \mforall{}i:Id.
\mforall{}[P:\{e:E| loc(e) = i\} {}\mrightarrow{} \mBbbP{}]
((\mforall{}e:\{e:E| loc(e) = i\} . Dec(P[e]))
{}\mRightarrow{} (\mforall{}e:E. P[e] {}\mRightarrow{} (\mexists{}e':E. (e' \mleq{}loc e \mwedge{} e' is first@ i s.t. e.P[e])) supposing loc(e) = i))
Date html generated:
2016_05_16-AM-09_48_57
Last ObjectModification:
2016_01_17-PM-01_26_18
Theory : new!event-ordering
Home
Index