Nuprl Lemma : simple-comb2-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 ∈ λa,b.lifting2(f;a;b)|X;Y|(e);↓∃a:A. ∃b:B. ((a ∈ X(e) ∧ b ∈ Y(e)) ∧ (v = (f a b) ∈ C)))
Proof
Definitions occuring in Statement :
simple-comb2: λx,y.F[x; y]|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,
lifting2: lifting2(f;abag;bbag)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
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,
less_than: a < b,
squash: ↓T,
true: True,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
so_lambda: λ2x.t[x],
so_apply: x[s],
uiff: uiff(P;Q),
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
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),
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt,
cand: A c∧ B,
rev_uimplies: rev_uimplies(P;Q),
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{} \mlambda{}a,b.lifting2(f;a;b)|X;Y|(e);\mdownarrow{}\mexists{}a:A. \mexists{}b:B. ((a \mmember{} X(e) \mwedge{} b \mmember{} Y(e)) \mwedge{} (v = (f a b))))
Date html generated:
2016_05_17-AM-09_20_20
Last ObjectModification:
2016_01_17-PM-11_16_20
Theory : classrel!lemmas
Home
Index