Nuprl Lemma : return-loc-bag-class-program_wf
∀[Info,B:Type]. ∀[x:Id ⟶ bag(B)].
return-loc-bag-class-program(x) ∈ LocalClass(return-loc-bag-class(x)) supposing valueall-type(B)
Proof
Definitions occuring in Statement :
return-loc-bag-class-program: return-loc-bag-class-program(x),
return-loc-bag-class: return-loc-bag-class(x),
local-class: LocalClass(X),
Id: Id,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
return-loc-bag-class-program: return-loc-bag-class-program(x),
hdf-return: hdf-return(x),
local-class: LocalClass(X),
sq_exists: ∃x:{A| B[x]},
all: ∀x:A. B[x],
return-loc-bag-class: return-loc-bag-class(x),
class-ap: X(e),
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
es-before: before(e),
top: Top,
pi2: snd(t),
hdf-ap: X(a),
hdf-run: hdf-run(P),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
nat_plus: ℕ+,
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
true: True,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
cons: [a / b],
pi1: fst(t),
hdf-halt: hdf-halt(),
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[Info,B:Type]. \mforall{}[x:Id {}\mrightarrow{} bag(B)].
return-loc-bag-class-program(x) \mmember{} LocalClass(return-loc-bag-class(x)) supposing valueall-type(B)
Date html generated:
2016_05_17-AM-09_09_20
Last ObjectModification:
2016_01_17-PM-09_12_56
Theory : local!classes
Home
Index