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