Nuprl Lemma : omral_fma_wf
∀g:OCMon. ∀a:CDRng. (omral_fma(g;a) ∈ fma_sig{i:l}(g;a))
Proof
Definitions occuring in Statement :
omral_fma: omral_fma(g;a),
fma_sig: fma_sig{i:l}(G;A),
all: ∀x:A. B[x],
member: t ∈ T,
cdrng: CDRng,
ocmon: OCMon
Definitions unfolded in proof :
omral_fma: omral_fma(g;a),
fma_sig: fma_sig{i:l}(G;A),
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
cdrng: CDRng,
crng: CRng,
rng: Rng,
subtype_rel: A ⊆r B,
set_car: |p|,
pi1: fst(t),
omralist: omral(g;r),
oalist: oal(a;b),
dset_set: dset_set,
mk_dset: mk_dset(T, eq),
alg_car: a.car,
omral_alg: omral_alg(g;r),
ocmon: OCMon,
abmonoid: AbMon,
mon: Mon,
algebra: algebra{i:l}(A),
module: A-Module
Lemmas referenced :
omral_alg_wf,
omral_inj_wf,
rng_one_wf,
subtype_rel_self,
alg_car_wf,
rng_car_wf,
grp_car_wf,
omral_alg_umap_wf,
algebra_wf,
cdrng_wf,
ocmon_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
lambdaFormation,
cut,
dependent_pairEquality,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
hypothesis,
lambdaEquality,
isectElimination,
setElimination,
rename,
applyEquality,
functionEquality,
because_Cache,
cumulativity,
productEquality
Latex:
\mforall{}g:OCMon. \mforall{}a:CDRng. (omral\_fma(g;a) \mmember{} fma\_sig\{i:l\}(g;a))
Date html generated:
2018_05_22-AM-07_47_36
Last ObjectModification:
2018_05_19-AM-08_29_07
Theory : polynom_3
Home
Index