Nuprl Lemma : assert-bag-eq
∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[as,bs:bag(T)]. uiff(↑bag-eq(eq;as;bs);as = bs ∈ bag(T))
Proof
Definitions occuring in Statement :
bag-eq: bag-eq(eq;as;bs),
bag: bag(T),
deq: EqDecider(T),
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
bag-eq: bag-eq(eq;as;bs),
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
cand: A c∧ B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
so_apply: x[s],
squash: ↓T,
guard: {T},
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
nat: ℕ,
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
le: A ≤ B
Lemmas referenced :
bag-extensionality2,
assert-bag-all,
bag-member_wf,
all_wf,
equal_wf,
bag-count_wf,
less_than_wf,
iff_weakening_equal,
squash_wf,
true_wf,
nat_wf,
and_wf,
bag_wf,
member-less_than,
assert_of_eq_int,
assert_of_lt_int,
assert_wf,
eq_int_wf,
lt_int_wf,
assert_witness,
uiff_wf,
bag-all_wf,
iff_weakening_uiff,
band_wf,
assert_of_band,
bag-eq_wf,
deq_wf,
bag-member-count,
decidable__le,
satisfiable-full-omega-tt,
intformand_wf,
intformnot_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_lemma,
int_formula_prop_not_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
decidable__lt
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
because_Cache,
productElimination,
independent_pairFormation,
isect_memberFormation,
hypothesis,
independent_isectElimination,
lambdaFormation,
cumulativity,
productEquality,
sqequalRule,
lambdaEquality,
functionEquality,
intEquality,
applyEquality,
natural_numberEquality,
imageElimination,
dependent_functionElimination,
independent_functionElimination,
equalityTransitivity,
equalitySymmetry,
imageMemberEquality,
baseClosed,
universeEquality,
setElimination,
rename,
addLevel,
hyp_replacement,
dependent_set_memberEquality,
applyLambdaEquality,
levelHypothesis,
independent_pairEquality,
axiomEquality,
allFunctionality,
isect_memberEquality,
unionElimination,
dependent_pairFormation,
int_eqEquality,
voidElimination,
voidEquality,
computeAll
Latex:
\mforall{}[T:Type]. \mforall{}[eq:EqDecider(T)]. \mforall{}[as,bs:bag(T)]. uiff(\muparrow{}bag-eq(eq;as;bs);as = bs)
Date html generated:
2018_05_21-PM-09_47_20
Last ObjectModification:
2017_07_26-PM-06_30_10
Theory : bags_2
Home
Index