Nuprl Lemma : fpf-compatible-single
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f:a:A fp-> B[a]]. ∀[x:A]. ∀[v:B[x]]. f || x : v supposing ¬↑x ∈ dom(f)
Proof
Definitions occuring in Statement :
fpf-single: x : v,
fpf-compatible: f || g,
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
deq: EqDecider(T),
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
not: ¬A,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-compatible: f || g,
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
implies: P ⇒ Q,
and: P ∧ Q,
uall: ∀[x:A]. B[x],
uiff: uiff(P;Q),
uimplies: b supposing a,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
not: ¬A,
false: False
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. \mforall{}[x:A]. \mforall{}[v:B[x]].
f || x : v supposing \mneg{}\muparrow{}x \mmember{} dom(f)
Date html generated:
2016_05_16-AM-11_29_52
Last ObjectModification:
2015_12_29-AM-09_26_10
Theory : event-ordering
Home
Index