Nuprl Lemma : A-loop_wf2
∀[Val:Type]. ∀[n:ℕ]. ∀[AType:array{i:l}(Val;n)].
∀lo,hi:ℕn. ∀[body:{lo..hi-} ⟶ (A-map Unit)]. (A-loop(AType;lo;hi;body) ∈ A-map Unit)
Proof
Definitions occuring in Statement :
A-loop: A-loop(AType;lo;hi;body),
A-map: A-map,
array-model: array-model(AType),
array: array{i:l}(Val;n),
int_seg: {i..j-},
nat: ℕ,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
unit: Unit,
member: t ∈ T,
apply: f a,
function: x:A ⟶ B[x],
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
int_seg: {i..j-},
nat: ℕ,
decidable: Dec(P),
or: P ∨ Q,
guard: {T},
lelt: i ≤ j < k,
and: P ∧ Q,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtract: n - m,
sq_type: SQType(T),
squash: ↓T,
label: ...$L... t,
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
A-loop: A-loop(AType;lo;hi;body),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff
Lemmas referenced :
int_seg_wf,
A-map_wf,
unit_wf2,
array_wf,
nat_wf,
decidable__lt,
A-loop_wf,
subtract_wf,
int_seg_properties,
nat_properties,
decidable__le,
satisfiable-full-omega-tt,
intformand_wf,
intformnot_wf,
intformle_wf,
itermConstant_wf,
itermSubtract_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_lemma,
int_formula_prop_not_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_subtract_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
le_wf,
subtype_base_sq,
set_subtype_base,
lelt_wf,
int_subtype_base,
minus-one-mul,
add-swap,
add-mul-special,
zero-mul,
add-zero,
member_wf,
squash_wf,
true_wf,
iff_weakening_equal,
and_wf,
equal_wf,
le_int_wf,
bool_wf,
equal-wf-T-base,
assert_wf,
A-null_wf,
lt_int_wf,
less_than_wf,
bnot_wf,
uiff_transitivity,
eqtt_to_assert,
assert_of_le_int,
eqff_to_assert,
assert_functionality_wrt_uiff,
bnot_of_le_int,
assert_of_lt_int
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lambdaFormation,
sqequalHypSubstitution,
hypothesis,
sqequalRule,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
functionEquality,
extract_by_obid,
isectElimination,
thin,
setElimination,
rename,
hypothesisEquality,
applyEquality,
cumulativity,
natural_numberEquality,
lambdaEquality,
dependent_functionElimination,
isect_memberEquality,
because_Cache,
universeEquality,
unionElimination,
dependent_set_memberEquality,
productElimination,
independent_isectElimination,
dependent_pairFormation,
int_eqEquality,
intEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
independent_functionElimination,
instantiate,
imageElimination,
imageMemberEquality,
baseClosed,
hyp_replacement,
applyLambdaEquality,
equalityElimination
Latex:
\mforall{}[Val:Type]. \mforall{}[n:\mBbbN{}]. \mforall{}[AType:array\{i:l\}(Val;n)].
\mforall{}lo,hi:\mBbbN{}n. \mforall{}[body:\{lo..hi\msupminus{}\} {}\mrightarrow{} (A-map Unit)]. (A-loop(AType;lo;hi;body) \mmember{} A-map Unit)
Date html generated:
2017_10_01-AM-08_44_16
Last ObjectModification:
2017_07_26-PM-04_30_11
Theory : monads
Home
Index