Nuprl Lemma : collect_accm-wf2
∀[A:Type]. ∀[P:{L:A List| 0 < ||L||} ⟶ 𝔹]. ∀[num:A ⟶ ℕ].
(collect_accm(v.P[v];v.num[v]) ∈ {s:ℤ × {L:A List| 0 < ||L|| ⇒ (¬↑P[L])} × ({L:A List| 0 < ||L|| ∧ (↑P[L])} + Top)|\000C
(↑isl(snd(snd(s)))) ⇒ (1 ≤ (fst(s)))}
⟶ A
⟶ {s:ℤ × {L:A List| 0 < ||L|| ⇒ (¬↑P[L])} × ({L:A List| 0 < ||L|| ∧ (↑P[L])} + Top)|
(↑isl(snd(snd(s)))) ⇒ (1 ≤ (fst(s)))} )
Proof
Definitions occuring in Statement :
collect_accm: collect_accm(v.P[v];v.num[v]),
length: ||as||,
list: T List,
nat: ℕ,
assert: ↑b,
isl: isl(x),
bool: 𝔹,
less_than: a < b,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
pi1: fst(t),
pi2: snd(t),
le: A ≤ B,
not: ¬A,
implies: P ⇒ Q,
and: P ∧ Q,
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
product: x:A × B[x],
union: left + right,
natural_number: $n,
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
collect_accm: collect_accm(v.P[v];v.num[v]),
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
and: P ∧ Q,
so_apply: x[s],
pi2: snd(t),
pi1: fst(t),
has-value: (a)↓,
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
spreadn: spread3,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
isl: isl(x),
assert: ↑b,
bfalse: ff,
false: False,
not: ¬A,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
length: ||as||,
list_ind: list_ind,
nil: [],
cand: A c∧ B,
top: Top,
true: True,
decidable: Dec(P),
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
subtype_rel: A ⊆r B,
isr: isr(x),
nat_plus: ℕ+
Latex:
\mforall{}[A:Type]. \mforall{}[P:\{L:A List| 0 < ||L||\} {}\mrightarrow{} \mBbbB{}]. \mforall{}[num:A {}\mrightarrow{} \mBbbN{}].
(collect\_accm(v.P[v];v.num[v]) \mmember{} \{s:\mBbbZ{}
\mtimes{} \{L:A List| 0 < ||L|| {}\mRightarrow{} (\mneg{}\muparrow{}P[L])\}
\mtimes{} (\{L:A List| 0 < ||L|| \mwedge{} (\muparrow{}P[L])\} + Top)|
(\muparrow{}isl(snd(snd(s)))) {}\mRightarrow{} (1 \mleq{} (fst(s)))\}
{}\mrightarrow{} A
{}\mrightarrow{} \{s:\mBbbZ{} \mtimes{} \{L:A List| 0 < ||L|| {}\mRightarrow{} (\mneg{}\muparrow{}P[L])\} \mtimes{} (\{L:A List| 0 < ||L|| \mwedge{} (\muparrow{}P[L])\} + Top)|
(\muparrow{}isl(snd(snd(s)))) {}\mRightarrow{} (1 \mleq{} (fst(s)))\} )
Date html generated:
2016_05_16-AM-10_11_23
Last ObjectModification:
2016_01_17-PM-01_32_19
Theory : new!event-ordering
Home
Index