Nuprl Lemma : hasloc_wf
∀[i:Id]. ∀[k:Knd]. (hasloc(k;i) ∈ 𝔹)
Proof
Definitions occuring in Statement :
hasloc: hasloc(k;i),
Knd: Knd,
Id: Id,
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
hasloc: hasloc(k;i),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
band: p ∧b 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
Latex:
\mforall{}[i:Id]. \mforall{}[k:Knd]. (hasloc(k;i) \mmember{} \mBbbB{})
Date html generated:
2016_05_16-AM-11_00_04
Last ObjectModification:
2015_12_29-AM-09_10_08
Theory : event-ordering
Home
Index