Nuprl Lemma : perm_mon_assoc
∀[T:Type]. ∀[a,b,c:Perm(T)]. (a O b O c = a O b O c ∈ Perm(T))
Proof
Definitions occuring in Statement :
comp_perm: comp_perm,
perm: Perm(T),
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
igrp: IGroup,
perm_igrp: perm_igrp(T),
mk_igrp: mk_igrp(T;op;id;inv),
grp_car: |g|,
pi1: fst(t),
grp_op: *,
pi2: snd(t),
infix_ap: x f y,
all: ∀x:A. B[x]
Lemmas referenced :
mon_assoc,
perm_igrp_wf,
igrp_wf,
perm_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
applyEquality,
lambdaEquality,
setElimination,
rename,
sqequalRule,
isect_memberEquality,
axiomEquality,
dependent_functionElimination,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[a,b,c:Perm(T)]. (a O b O c = a O b O c)
Date html generated:
2016_05_16-AM-07_29_24
Last ObjectModification:
2015_12_28-PM-05_36_28
Theory : perms_1
Home
Index