Nuprl Lemma : modify-combinator1_wf
∀[n:ℕ]
∀[A:ℕn ⟶ Type]. ∀[m:ℕ]. ∀[B:ℕm ⟶ Type]. ∀[T:Type]. ∀[f:(i:ℕn ⟶ (A i + Top)) ⟶ (i:ℕm ⟶ (B i + Top)) ⟶ T].
(modify-combinator1(f) ∈ (i:ℕn - 1 ⟶ if (i =z 0) then one_or_both(A 0;A 1) + Top else A (i + 1) + Top fi )
⟶ (i:ℕm ⟶ (B i + Top))
⟶ T)
supposing 1 < n
Proof
Definitions occuring in Statement :
modify-combinator1: modify-combinator1(f),
int_seg: {i..j-},
nat: ℕ,
ifthenelse: if b then t else f fi ,
eq_int: (i =z j),
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
member: t ∈ T,
apply: f a,
function: x:A ⟶ B[x],
union: left + right,
subtract: n - m,
add: n + m,
natural_number: $n,
universe: Type,
one_or_both: one_or_both(A;B)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
modify-combinator1: modify-combinator1(f),
int_seg: {i..j-},
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
guard: {T},
nat: ℕ,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
nequal: a ≠ b ∈ T ,
eq_int: (i =z j),
subtype_rel: A ⊆r B,
subtract: n - m
Latex:
\mforall{}[n:\mBbbN{}]
\mforall{}[A:\mBbbN{}n {}\mrightarrow{} Type]. \mforall{}[m:\mBbbN{}]. \mforall{}[B:\mBbbN{}m {}\mrightarrow{} Type]. \mforall{}[T:Type]. \mforall{}[f:(i:\mBbbN{}n {}\mrightarrow{} (A i + Top))
{}\mrightarrow{} (i:\mBbbN{}m {}\mrightarrow{} (B i + Top))
{}\mrightarrow{} T].
(modify-combinator1(f) \mmember{} (i:\mBbbN{}n - 1 {}\mrightarrow{} if (i =\msubz{} 0)
then one\_or\_both(A 0;A 1) + Top
else A (i + 1) + Top
fi )
{}\mrightarrow{} (i:\mBbbN{}m {}\mrightarrow{} (B i + Top))
{}\mrightarrow{} T)
supposing 1 < n
Date html generated:
2016_05_16-AM-10_10_32
Last ObjectModification:
2016_01_17-PM-01_23_11
Theory : new!event-ordering
Home
Index