f 
g == 
x:A. ((
x 
dom(f)) 
((x dom(g)) c
f(x) g(x)))
Definitions :
all: x:A. B[x],
implies: P Q,
cand: A c B,
assert: b,
fpf-dom: x dom(f),
l_contains: A B,
fpf-ap: f(x)
FDL editor aliases :
fpf-contains
f \msubseteq{}\msubseteq{} g == \mforall{}x:A. ((\muparrow{}x \mmember{} dom(f)) {}\mRightarrow{} ((\muparrow{}x \mmember{} dom(g)) c\mwedge{} f(x) \msubseteq{} g(x)))
Date html generated:
2010_08_26-PM-11_45_37
Last ObjectModification:
2008_02_27-PM-09_38_27
Home
Index