Nuprl Lemma : mk_abmonoid

[T:Type]. ∀[eq,le:T ⟶ T ⟶ 𝔹]. ∀[op:T ⟶ T ⟶ T]. ∀[id:T]. ∀[inv:T ⟶ T].
  (<T, eq, le, op, id, inv> ∈ AbMon) supposing (Comm(T;op) and Ident(T;op;id) and Assoc(T;op))


Definitions occuring in Statement :  abmonoid: AbMon ident: Ident(T;op;id) comm: Comm(T;op) assoc: Assoc(T;op) bool: 𝔹 uimplies: 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: supposing a prop: abmonoid: AbMon grp_car: |g| pi1: fst(t) grp_op: * pi2: snd(t) mon: Mon grp_sig: GrpSig grp_id: e monoid_p: IsMonoid(T;op;id) and: P ∧ Q
Lemmas referenced :  comm_wf ident_wf assoc_wf bool_wf grp_car_wf grp_op_wf monoid_p_wf grp_id_wf
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 dependent_pairEquality productEquality independent_pairFormation

\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{}  AbMon)  supposing  (Comm(T;op)  and  Ident(T;op;id)  and  Assoc(T;op))

Date html generated: 2016_05_15-PM-00_07_30
Last ObjectModification: 2015_12_26-PM-11_47_43

Theory : groups_1

Home Index