Nuprl Lemma : fpf-empty_wf
∀[A:Type]. ∀[B:A ⟶ Type]. (⊗ ∈ x:A fp-> B[x])
Proof
Definitions occuring in Statement :
fpf-empty: ⊗,
fpf: a:A fp-> B[a],
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-empty: ⊗,
fpf: a:A fp-> B[a],
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
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]. (\motimes{} \mmember{} x:A fp-> B[x])
Date html generated:
2016_05_16-AM-11_04_13
Last ObjectModification:
2015_12_29-AM-09_12_47
Theory : event-ordering
Home
Index