Nuprl Lemma : class-at-program-eq-hdf
∀[A,B:Type]. ∀[pr1,pr2:Id ⟶ hdataflow(A;B)]. ∀[locs:bag(Id)].
((pr1)@locs = (pr2)@locs ∈ (Id ⟶ hdataflow(A;B))) supposing
((pr1 = pr2 ∈ (Id ⟶ hdataflow(A;B))) and
valueall-type(B))
Proof
Definitions occuring in Statement :
class-at-program: (pr)@locs,
hdataflow: hdataflow(A;B),
Id: Id,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
class-at-program: (pr)@locs,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A
Latex:
\mforall{}[A,B:Type]. \mforall{}[pr1,pr2:Id {}\mrightarrow{} hdataflow(A;B)]. \mforall{}[locs:bag(Id)].
((pr1)@locs = (pr2)@locs) supposing ((pr1 = pr2) and valueall-type(B))
Date html generated:
2016_05_17-AM-09_09_05
Last ObjectModification:
2015_12_29-PM-03_35_50
Theory : local!classes
Home
Index