Nuprl Lemma : fpf-dom_wf
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[f:a:A fp-> Top]. ∀[x:A]. (x ∈ dom(f) ∈ 𝔹)
Proof
Definitions occuring in Statement :
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
deq: EqDecider(T),
bool: 𝔹,
uall: ∀[x:A]. B[x],
top: Top,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f:a:A fp-> Top]. \mforall{}[x:A]. (x \mmember{} dom(f) \mmember{} \mBbbB{})
Date html generated:
2016_05_16-AM-11_03_16
Last ObjectModification:
2015_12_29-AM-09_12_05
Theory : event-ordering
Home
Index