Nuprl Lemma : run-to-n_wf
∀[B1,a1:Type]. ∀[r:ℤ ⟶ (a1 × B1)]. ∀[n:ℤ]. (run-to-n(r;n) ∈ a1 List)
Proof
Definitions occuring in Statement :
run-to-n: run-to-n(r;n),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
run-to-n: run-to-n(r;n),
int_seg: {i..j-},
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top
Latex:
\mforall{}[B1,a1:Type]. \mforall{}[r:\mBbbZ{} {}\mrightarrow{} (a1 \mtimes{} B1)]. \mforall{}[n:\mBbbZ{}]. (run-to-n(r;n) \mmember{} a1 List)
Date html generated:
2016_05_17-AM-11_35_49
Last ObjectModification:
2015_12_29-PM-06_47_53
Theory : event-logic-applications
Home
Index