Nuprl Lemma : Accum-loc-class-as-loop-class2
∀[Info,B,A:Type]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)]. ∀[X:EClass(A)].
(loop-class2((f o X);init) = Accum-loc-class(f;init;X) ∈ EClass(B))
Proof
Definitions occuring in Statement :
Accum-loc-class: Accum-loc-class(f;init;X),
loop-class2: loop-class2(X;init),
eclass1: (f o X),
eclass: EClass(A[eo; e]),
Id: Id,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
eclass: EClass(A[eo; e]),
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
loop-class2: loop-class2(X;init),
eclass1: (f o X),
eclass3: eclass3(X;Y),
class-ap: X(e),
so_lambda: λ2x.t[x],
so_apply: x[s],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
Accum-loc-class: Accum-loc-class(f;init;X),
rec-combined-loc-class-opt-1: F|Loc, X, Prior(self)?init|,
rec-comb: rec-comb(X;f;init),
select: L[n],
cons: [a / b],
lifting-loc-2: lifting-loc-2(f),
lifting2-loc: lifting2-loc(f;loc;abag;bbag),
lifting-loc-gen-rev: lifting-loc-gen-rev(n;bags;loc;f),
lifting-gen-rev: lifting-gen-rev(n;f;bags),
lifting-gen-list-rev: lifting-gen-list-rev(n;bags),
eq_int: (i =z j),
ifthenelse: if b then t else f fi ,
bfalse: ff,
subtract: n - m,
btrue: tt,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
true: True
Latex:
\mforall{}[Info,B,A:Type]. \mforall{}[f:Id {}\mrightarrow{} A {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[init:Id {}\mrightarrow{} bag(B)]. \mforall{}[X:EClass(A)].
(loop-class2((f o X);init) = Accum-loc-class(f;init;X))
Date html generated:
2016_05_17-AM-09_21_26
Last ObjectModification:
2016_01_17-PM-11_12_39
Theory : classrel!lemmas
Home
Index