Nuprl Lemma : mk_dmon
∀[T:Type]. ∀[eq,le:T ⟶ T ⟶ 𝔹]. ∀[op:T ⟶ T ⟶ T]. ∀[id:T]. ∀[inv:T ⟶ T].
(<T, eq, le, op, id, inv> ∈ DMon) supposing (Ident(T;op;id) and Assoc(T;op) and IsEqFun(T;eq))
Proof
Definitions occuring in Statement :
dmon: DMon,
ident: Ident(T;op;id),
eqfun_p: IsEqFun(T;eq),
assoc: Assoc(T;op),
bool: 𝔹,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
pair: <a, b>,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ,
dmon: DMon,
grp_car: |g|,
pi1: fst(t),
grp_eq: =b,
pi2: snd(t),
mon: Mon
Lemmas referenced :
ident_wf,
assoc_wf,
eqfun_p_wf,
bool_wf,
grp_car_wf,
grp_eq_wf,
mk_mon
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalHypSubstitution,
hypothesis,
sqequalRule,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
isect_memberEquality,
because_Cache,
functionEquality,
universeEquality,
dependent_set_memberEquality,
setElimination,
rename,
independent_isectElimination
Latex:
\mforall{}[T:Type]. \mforall{}[eq,le:T {}\mrightarrow{} T {}\mrightarrow{} \mBbbB{}]. \mforall{}[op:T {}\mrightarrow{} T {}\mrightarrow{} T]. \mforall{}[id:T]. \mforall{}[inv:T {}\mrightarrow{} T].
(<T, eq, le, op, id, inv> \mmember{} DMon) supposing (Ident(T;op;id) and Assoc(T;op) and IsEqFun(T;eq))
Date html generated:
2016_05_15-PM-00_06_57
Last ObjectModification:
2015_12_26-PM-11_47_35
Theory : groups_1
Home
Index