Nuprl Lemma : map-class_functionality
∀[Info,T,A,B:Type]. ∀[f:A ⟶ T]. ∀[g:B ⟶ T]. ∀[X:EClass(A)]. ∀[Y:EClass(B)].
(f[a] where a from X) = (g[b] where b from Y) ∈ EClass(T)
supposing ∀es:EO+(Info). ∀e:E. ((↑e ∈b X ⇐⇒ ↑e ∈b Y) ∧ ((↑e ∈b X) ⇒ (↑e ∈b Y) ⇒ (f[X(e)] = g[Y(e)] ∈ T)))
Proof
Definitions occuring in Statement :
map-class: (f[v] where v from X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
and: P ∧ Q,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
top: Top,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
es-E-interface: E(X),
prop: ℙ,
rev_implies: P ⇐ Q,
guard: {T},
sv-class: Singlevalued(X),
map-class: (f[v] where v from X),
es-filter-image: f[X],
eclass-compose1: f o X,
eclass-val: X(e),
in-eclass: e ∈b X,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b
Latex:
\mforall{}[Info,T,A,B:Type]. \mforall{}[f:A {}\mrightarrow{} T]. \mforall{}[g:B {}\mrightarrow{} T]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)].
(f[a] where a from X) = (g[b] where b from Y)
supposing \mforall{}es:EO+(Info). \mforall{}e:E.
((\muparrow{}e \mmember{}\msubb{} X \mLeftarrow{}{}\mRightarrow{} \muparrow{}e \mmember{}\msubb{} Y) \mwedge{} ((\muparrow{}e \mmember{}\msubb{} X) {}\mRightarrow{} (\muparrow{}e \mmember{}\msubb{} Y) {}\mRightarrow{} (f[X(e)] = g[Y(e)])))
Date html generated:
2016_05_16-PM-10_31_02
Last ObjectModification:
2015_12_29-AM-11_06_13
Theory : event-ordering
Home
Index