Nuprl Lemma : es-bound-list
∀es:EO
∀[T:Type]
∀i:Id
∀[P:T ⟶ ℙ]. ∀[Q:E ⟶ T ⟶ ℙ].
((∀x:T. Dec(P[x]))
⇒ (∀L:T List
(∀x∈L.P[x] ⇒ (∃e:E. Q[e;x]))
⇒ ∃e'@i.True supposing ¬(∃x∈L. P[x])
⇒ ∃e'@i.(∀x∈L.P[x] ⇒ (∃e:E. (e ≤loc e' ∧ Q[e;x])))
supposing (∀x∈L.∀e:E. (Q[e;x] ⇒ (loc(e) = i ∈ Id)))))
Proof
Definitions occuring in Statement :
existse-at: ∃e@i.P[e],
es-le: e ≤loc e' ,
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
l_exists: (∃x∈L. P[x]),
l_all: (∀x∈L.P[x]),
list: T List,
decidable: Dec(P),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
so_apply: x[s],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
and: P ∧ Q,
true: True,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
so_lambda: λ2x.t[x],
uimplies: b supposing a,
prop: ℙ,
so_apply: x[s1;s2],
subtype_rel: A ⊆r B,
so_apply: x[s],
exists: ∃x:A. B[x],
and: P ∧ Q,
l_all: (∀x∈L.P[x]),
int_seg: {i..j-},
guard: {T},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
top: Top,
iff: P ⇐⇒ Q,
existse-at: ∃e@i.P[e],
cand: A c∧ B,
less_than: a < b,
squash: ↓T,
uiff: uiff(P;Q),
rev_implies: P ⇐ Q,
true: True
Latex:
\mforall{}es:EO
\mforall{}[T:Type]
\mforall{}i:Id
\mforall{}[P:T {}\mrightarrow{} \mBbbP{}]. \mforall{}[Q:E {}\mrightarrow{} T {}\mrightarrow{} \mBbbP{}].
((\mforall{}x:T. Dec(P[x]))
{}\mRightarrow{} (\mforall{}L:T List
(\mforall{}x\mmember{}L.P[x] {}\mRightarrow{} (\mexists{}e:E. Q[e;x]))
{}\mRightarrow{} \mexists{}e'@i.True supposing \mneg{}(\mexists{}x\mmember{}L. P[x])
{}\mRightarrow{} \mexists{}e'@i.(\mforall{}x\mmember{}L.P[x] {}\mRightarrow{} (\mexists{}e:E. (e \mleq{}loc e' \mwedge{} Q[e;x])))
supposing (\mforall{}x\mmember{}L.\mforall{}e:E. (Q[e;x] {}\mRightarrow{} (loc(e) = i)))))
Date html generated:
2016_05_16-AM-09_50_27
Last ObjectModification:
2016_01_17-PM-01_28_21
Theory : new!event-ordering
Home
Index