Nuprl Lemma : oal_neg_left_inv
∀a:LOSet. ∀b:AbDGrp. ∀ps:|oal(a;b)|. (((--ps) ++ ps) = 00 ∈ |oal(a;b)|)
Proof
Definitions occuring in Statement :
oal_neg: --ps,
oal_merge: ps ++ qs,
oal_nil: 00,
oalist: oal(a;b),
all: ∀x:A. B[x],
equal: s = t ∈ T,
abdgrp: AbDGrp,
loset: LOSet,
set_car: |p|
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
abdgrp: AbDGrp,
abgrp: AbGrp,
grp: Group{i},
abdmonoid: AbDMon,
dmon: DMon,
uall: ∀[x:A]. B[x],
mon: Mon,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
implies: P ⇒ Q,
sq_stable: SqStable(P),
squash: ↓T,
loset: LOSet,
poset: POSet{i},
qoset: QOSet,
dset: DSet,
infix_ap: x f y,
guard: {T},
oalist: oal(a;b),
dset_set: dset_set,
mk_dset: mk_dset(T, eq),
set_car: |p|,
pi1: fst(t),
dset_list: s List,
set_prod: s × t,
dset_of_mon: g↓set,
oal_nil: 00,
nil: [],
it: ⋅,
true: True,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
top: Top
Lemmas referenced :
lookups_same_a,
subtype_rel_sets,
mon_wf,
inverse_wf,
grp_car_wf,
grp_op_wf,
grp_id_wf,
grp_inv_wf,
comm_wf,
eqfun_p_wf,
grp_eq_wf,
set_wf,
sq_stable__comm,
oal_merge_wf2,
oal_neg_wf2,
oal_nil_wf,
set_car_wf,
oalist_wf,
abdgrp_wf,
loset_wf,
equal_wf,
squash_wf,
true_wf,
lookup_merge,
lookup_oal_neg,
grp_subtype_igrp,
abgrp_subtype_grp,
abdgrp_subtype_abgrp,
subtype_rel_transitivity,
abgrp_wf,
grp_wf,
igrp_wf,
lookup_wf,
nil_wf,
iff_weakening_equal,
lookup_nil_lemma,
grp_inverse
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
applyEquality,
sqequalRule,
instantiate,
isectElimination,
setEquality,
hypothesis,
cumulativity,
setElimination,
rename,
because_Cache,
lambdaEquality,
independent_isectElimination,
independent_functionElimination,
imageMemberEquality,
baseClosed,
imageElimination,
equalityTransitivity,
equalitySymmetry,
universeEquality,
productEquality,
natural_numberEquality,
productElimination,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}a:LOSet. \mforall{}b:AbDGrp. \mforall{}ps:|oal(a;b)|. (((--ps) ++ ps) = 00)
Date html generated:
2017_10_01-AM-10_03_20
Last ObjectModification:
2017_03_03-PM-01_05_58
Theory : polynom_2
Home
Index