Nuprl Lemma : rec-comb_wf
∀[Info:Type]. ∀[n:ℕ]. ∀[A:ℕn ─→ Type]. ∀[X:i:ℕn ─→ EClass(A i)]. ∀[T:Type]. ∀[f:Id
─→ (i:ℕn ─→ bag(A i))
─→ bag(T)
─→ bag(T)]. ∀[init:Id ─→ bag(T)].
(rec-comb(X;f;init) ∈ EClass(T))
Proof
Definitions occuring in Statement :
rec-comb: rec-comb(X;f;init),
eclass: EClass(A[eo; e]),
Id: Id,
int_seg: {i..j-},
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
apply: f a,
function: x:A ─→ B[x],
natural_number: $n,
universe: Type,
bag: bag(T)
Lemmas :
es-causl-swellfnd,
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
int_seg_wf,
int_seg_subtype-nat,
decidable__le,
subtract_wf,
false_wf,
not-ge-2,
less-iff-le,
condition-implies-le,
minus-one-mul,
zero-add,
minus-add,
minus-minus,
add-associates,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
decidable__equal_int,
subtype_rel-int_seg,
le_weakening,
int_seg_properties,
le_wf,
nat_wf,
zero-le-nat,
lelt_wf,
es-causl_wf,
es-loc_wf,
equal_wf,
decidable__lt,
not-equal-2,
le-add-cancel-alt,
not-le-2,
sq_stable__le,
add-mul-special,
zero-mul,
es-E_wf,
event-ordering+_subtype,
void_wf,
event-ordering+_wf,
Id_wf,
bag_wf,
eclass_wf,
es-causl_weakening,
bag-size_wf,
or_wf,
sq_exists_wf,
assert_wf,
lt_int_wf,
all_wf,
es-locl_wf,
not_wf,
es-local-pred_wf2
Latex:
\mforall{}[Info:Type]. \mforall{}[n:\mBbbN{}]. \mforall{}[A:\mBbbN{}n {}\mrightarrow{} Type]. \mforall{}[X:i:\mBbbN{}n {}\mrightarrow{} EClass(A i)]. \mforall{}[T:Type]. \mforall{}[f:Id
{}\mrightarrow{} (i:\mBbbN{}n
{}\mrightarrow{} bag(A i))
{}\mrightarrow{} bag(T)
{}\mrightarrow{} bag(T)].
\mforall{}[init:Id {}\mrightarrow{} bag(T)].
(rec-comb(X;f;init) \mmember{} EClass(T))
Date html generated:
2015_07_21-PM-02_49_10
Last ObjectModification:
2015_01_27-PM-07_36_03
Home
Index