Nuprl Definition : weak-antecedent-surjection
Q ←←= f== P == Q ←==f== P ∧ (∀e:{e:E| Q e} . ∃e':{e:E| P e} . ((f e') = e ∈ E))
Definitions occuring in Statement :
weak-antecedent-function: Q ←==f== P,
es-E: E,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
and: P ∧ Q,
set: {x:A| B[x]} ,
apply: f a,
equal: s = t ∈ T
FDL editor aliases :
weak-antecedent-surjection
weak-antecedent-surjection
Latex:
Q \mleftarrow{}\mleftarrow{}= f== P == Q \mleftarrow{}==f== P \mwedge{} (\mforall{}e:\{e:E| Q e\} . \mexists{}e':\{e:E| P e\} . ((f e') = e))
Date html generated:
2016_05_16-AM-10_16_40
Last ObjectModification:
2013_03_25-PM-01_55_46
Theory : new!event-ordering
Home
Index