Nuprl Lemma : assert-isname
∀[L:Cname List]. ∀[z:extd-nameset(L)]. uiff(↑isname(z);z ∈ nameset(L))
Proof
Definitions occuring in Statement :
isname: isname(z),
extd-nameset: extd-nameset(L),
nameset: nameset(L),
coordinate_name: Cname,
list: T List,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
prop: ℙ,
implies: P ⇒ Q,
extd-nameset: extd-nameset(L),
b-union: A ⋃ B,
tunion: ⋃x:A.B[x],
bool: 𝔹,
unit: Unit,
ifthenelse: if b then t else f fi ,
pi2: snd(t),
false: False,
all: ∀x:A. B[x],
int_seg: {i..j-},
decidable: Dec(P),
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
isname: isname(z),
le_int: i ≤z j,
lt_int: i <z j,
bnot: ¬bb,
btrue: tt,
assert: ↑b,
bfalse: ff,
le: A ≤ B,
less_than': less_than'(a;b),
not: ¬A,
lelt: i ≤ j < k,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
nameset: nameset(L),
coordinate_name: Cname,
int_upper: {i...},
rev_uimplies: rev_uimplies(P;Q),
subtype_rel: A ⊆r B
Lemmas referenced :
assert_witness,
extd-nameset_wf,
list_wf,
coordinate_name_wf,
decidable__equal_int,
subtype_base_sq,
int_subtype_base,
int_seg_properties,
false_wf,
int_seg_subtype,
int_seg_cases,
satisfiable-full-omega-tt,
intformand_wf,
intformless_wf,
itermVar_wf,
itermConstant_wf,
intformle_wf,
int_formula_prop_and_lemma,
int_formula_prop_less_lemma,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_wf,
assert_wf,
isname_wf,
nameset_wf,
equal_wf,
assert_of_le_int,
extd-nameset_subtype_base,
base_wf,
equal-wf-base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
independent_pairFormation,
introduction,
cut,
sqequalRule,
sqequalHypSubstitution,
axiomEquality,
equalityTransitivity,
hypothesis,
equalitySymmetry,
extract_by_obid,
isectElimination,
thin,
independent_functionElimination,
hypothesisEquality,
imageElimination,
productElimination,
unionElimination,
equalityElimination,
voidElimination,
dependent_functionElimination,
setElimination,
rename,
natural_numberEquality,
instantiate,
cumulativity,
intEquality,
independent_isectElimination,
because_Cache,
lambdaFormation,
hypothesis_subsumption,
addEquality,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
isect_memberEquality,
voidEquality,
computeAll,
applyEquality
Latex:
\mforall{}[L:Cname List]. \mforall{}[z:extd-nameset(L)]. uiff(\muparrow{}isname(z);z \mmember{} nameset(L))
Date html generated:
2017_10_05-AM-10_05_21
Last ObjectModification:
2017_07_28-AM-11_16_01
Theory : cubical!sets
Home
Index