Nuprl Lemma : simple-comb-2-classrel
∀[Info,A,B,C:Type]. ∀[f:A ⟶ B ⟶ C]. ∀[X:EClass(A)]. ∀[Y:EClass(B)]. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:C].
uiff(v ∈ lifting-2(f)|X, Y|(e);↓∃a:A. ∃b:B. ((v = (f a b) ∈ C) ∧ b ∈ Y(e) ∧ a ∈ X(e)))
Proof
Definitions occuring in Statement :
simple-comb-2: F|X, Y|,
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
exists: ∃x:A. B[x],
squash: ↓T,
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T,
lifting-2: lifting-2(f)
Definitions unfolded in proof :
member: t ∈ T,
all: ∀x:A. B[x],
int_seg: {i..j-},
decidable: Dec(P),
or: P ∨ Q,
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
sq_type: SQType(T),
implies: P ⇒ Q,
guard: {T},
select: L[n],
cons: [a / b],
and: P ∧ Q,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
subtract: n - m,
lelt: i ≤ j < k,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
nat: ℕ,
less_than: a < b,
squash: ↓T,
true: True,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uiff: uiff(P;Q),
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
lifting-2: lifting-2(f),
simple-comb-2: F|X, Y|,
simple-comb2: λx,y.F[x; y]|X;Y|
Latex:
\mforall{}[Info,A,B,C:Type]. \mforall{}[f:A {}\mrightarrow{} B {}\mrightarrow{} C]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E].
\mforall{}[v:C].
uiff(v \mmember{} lifting-2(f)|X, Y|(e);\mdownarrow{}\mexists{}a:A. \mexists{}b:B. ((v = (f a b)) \mwedge{} b \mmember{} Y(e) \mwedge{} a \mmember{} X(e)))
Date html generated:
2016_05_17-AM-09_20_56
Last ObjectModification:
2016_01_17-PM-11_12_36
Theory : classrel!lemmas
Home
Index