Nuprl Lemma : concat-lifting1-loc_wf
∀[A,B:Type]. ∀[f:Id ⟶ A ⟶ bag(B)]. ∀[b:bag(A)]. ∀[l:Id]. (concat-lifting1-loc(f;b;l) ∈ bag(B))
Proof
Definitions occuring in Statement :
concat-lifting1-loc: concat-lifting1-loc(f;bag;loc),
Id: Id,
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,
concat-lifting1-loc: concat-lifting1-loc(f;bag;loc),
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
funtype: funtype(n;A;T),
top: Top
Latex:
\mforall{}[A,B:Type]. \mforall{}[f:Id {}\mrightarrow{} A {}\mrightarrow{} bag(B)]. \mforall{}[b:bag(A)]. \mforall{}[l:Id]. (concat-lifting1-loc(f;b;l) \mmember{} bag(B))
Date html generated:
2016_05_17-AM-09_15_36
Last ObjectModification:
2015_12_29-PM-04_09_28
Theory : classrel!lemmas
Home
Index