Nuprl Lemma : fpf-null-domain
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[f:Void ⟶ Top]. (<[], f> = ⊗ ∈ x:A fp-> B[x])
Proof
Definitions occuring in Statement :
fpf-empty: ⊗,
fpf: a:A fp-> B[a],
nil: [],
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
function: x:A ⟶ B[x],
pair: <a, b>,
void: Void,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf-empty: ⊗,
fpf: a:A fp-> B[a],
uimplies: b supposing a,
not: ¬A,
implies: P ⇒ Q,
false: False,
prop: ℙ,
so_apply: x[s]
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:Void {}\mrightarrow{} Top]. (<[], f> = \motimes{})
Date html generated:
2016_05_16-AM-11_04_28
Last ObjectModification:
2015_12_29-AM-09_13_11
Theory : event-ordering
Home
Index