Nuprl Lemma : extend-val_wf
∀[a:formula()]. ∀[v0:{b:formula()| b ⊆ a ∧ (↑pvar?(b))} ⟶ 𝔹]. ∀[g:{b:formula()| b ⊆ a} ⟶ 𝔹]. (extend-val(v0;g;a) ∈ \000C𝔹)
Proof
Definitions occuring in Statement :
extend-val: extend-val(v0;g;x),
psub: a ⊆ b,
pvar?: pvar?(v),
formula: formula(),
assert: ↑b,
bool: 𝔹,
uall: ∀[x:A]. B[x],
and: P ∧ Q,
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
subtype_rel: A ⊆r B,
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
le: A ≤ B,
less_than': less_than'(a;b),
ext-eq: A ≡ B,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
sq_type: SQType(T),
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
pvar: pvar(name),
formula_size: formula_size(p),
extend-val: extend-val(v0;g;x),
psub: a ⊆ b,
formula_ind: formula_ind,
cand: A c∧ B,
assert: ↑b,
pvar?: pvar?(v),
pi1: fst(t),
true: True,
bfalse: ff,
bnot: ¬bb,
pnot: pnot(sub),
less_than: a < b,
squash: ↓T,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
pand: pand(left;right),
band: p ∧b q,
por: por(left;right),
pimp: pimp(left;right)
Lemmas referenced :
nat_properties,
satisfiable-full-omega-tt,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_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,
ge_wf,
less_than_wf,
formula_wf,
psub_wf,
bool_wf,
assert_wf,
pvar?_wf,
le_wf,
formula_size_wf,
int_seg_wf,
int_seg_properties,
decidable__le,
subtract_wf,
intformnot_wf,
itermSubtract_wf,
int_formula_prop_not_lemma,
int_term_value_subtract_lemma,
decidable__equal_int,
int_seg_subtype,
false_wf,
intformeq_wf,
int_formula_prop_eq_lemma,
formula-ext,
eq_atom_wf,
eqtt_to_assert,
assert_of_eq_atom,
subtype_base_sq,
atom_subtype_base,
equal-wf-T-base,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_atom,
decidable__lt,
itermAdd_wf,
int_term_value_add_lemma,
lelt_wf,
bnot_wf,
or_wf,
pnot_wf,
psub-same,
true_wf,
pand_wf,
bor_wf,
por_wf,
pimp_wf,
nat_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
thin,
lambdaFormation,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
sqequalRule,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
intEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
independent_functionElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
functionEquality,
setEquality,
productEquality,
applyEquality,
because_Cache,
productElimination,
unionElimination,
applyLambdaEquality,
hypothesis_subsumption,
dependent_set_memberEquality,
promote_hyp,
tokenEquality,
equalityElimination,
instantiate,
cumulativity,
atomEquality,
functionExtensionality,
baseApply,
closedConclusion,
baseClosed,
imageElimination,
inrFormation,
addLevel,
orFunctionality,
addEquality,
inlFormation
Latex:
\mforall{}[a:formula()]. \mforall{}[v0:\{b:formula()| b \msubseteq{} a \mwedge{} (\muparrow{}pvar?(b))\} {}\mrightarrow{} \mBbbB{}]. \mforall{}[g:\{b:formula()| b \msubseteq{} a\} {}\mrightarrow{} \mBbbB{}].
(extend-val(v0;g;a) \mmember{} \mBbbB{})
Date html generated:
2018_05_21-PM-08_53_35
Last ObjectModification:
2017_07_26-PM-06_17_21
Theory : general
Home
Index