Nuprl Lemma : lifting2-loc_wf
∀[A,B,C:Type]. ∀[f:Id ⟶ A ⟶ B ⟶ C]. ∀[loc:Id]. ∀[abag:bag(A)]. ∀[bbag:bag(B)].
(lifting2-loc(f;loc;abag;bbag) ∈ bag(C))
Proof
Definitions occuring in Statement :
lifting2-loc: lifting2-loc(f;loc;abag;bbag),
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,
lifting2-loc: lifting2-loc(f;loc;abag;bbag),
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
sq_type: SQType(T),
select: L[n],
cons: [a / b],
subtract: n - m,
funtype: funtype(n;A;T),
eq_int: (i =z j),
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[A,B,C:Type]. \mforall{}[f:Id {}\mrightarrow{} A {}\mrightarrow{} B {}\mrightarrow{} C]. \mforall{}[loc:Id]. \mforall{}[abag:bag(A)]. \mforall{}[bbag:bag(B)].
(lifting2-loc(f;loc;abag;bbag) \mmember{} bag(C))
Date html generated:
2016_05_17-AM-09_14_59
Last ObjectModification:
2016_01_17-PM-11_15_02
Theory : classrel!lemmas
Home
Index