Nuprl Definition : fpf-sub
f ⊆ g == ∀x:A. ((↑x ∈ dom(f)) ⇒ ((↑x ∈ dom(g)) c∧ (f(x) = g(x) ∈ B[x])))
Definitions occuring in Statement :
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
assert: ↑b,
cand: A c∧ B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
equal: s = t ∈ T
Definitions occuring in definition :
all: ∀x:A. B[x],
implies: P ⇒ Q,
cand: A c∧ B,
assert: ↑b,
fpf-dom: x ∈ dom(f),
equal: s = t ∈ T,
fpf-ap: f(x)
FDL editor aliases :
fpf-sub
Latex:
f \msubseteq{} g == \mforall{}x:A. ((\muparrow{}x \mmember{} dom(f)) {}\mRightarrow{} ((\muparrow{}x \mmember{} dom(g)) c\mwedge{} (f(x) = g(x))))
Date html generated:
2018_05_21-PM-09_18_37
Last ObjectModification:
2018_02_09-AM-10_17_13
Theory : finite!partial!functions
Home
Index