Nuprl Lemma : FormConst?_wf
∀[C:Type]. ∀[v:Form(C)]. (FormConst?(v) ∈ 𝔹)
Proof
Definitions occuring in Statement :
FormConst?: FormConst?(v),
Form: Form(C),
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
ext-eq: A ≡ B,
and: P ∧ Q,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
uimplies: b supposing a,
sq_type: SQType(T),
guard: {T},
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
FormVar: Vname,
FormConst?: FormConst?(v),
pi1: fst(t),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b,
false: False,
FormConst: Const(value),
FormSet: {var | phi},
FormEqual: left = right,
FormMember: element ∈ set,
FormAnd: left ∧ right),
FormOr: left ∨ right,
FormNot: ¬(body),
FormAll: ∀var. body,
FormExists: ∃var. body
Lemmas referenced :
Form-ext,
eq_atom_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_atom,
subtype_base_sq,
atom_subtype_base,
bfalse_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_atom,
btrue_wf,
Form_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
promote_hyp,
productElimination,
hypothesis_subsumption,
hypothesis,
applyEquality,
sqequalRule,
tokenEquality,
lambdaFormation,
unionElimination,
equalityElimination,
equalityTransitivity,
equalitySymmetry,
independent_isectElimination,
instantiate,
cumulativity,
atomEquality,
dependent_functionElimination,
independent_functionElimination,
because_Cache,
dependent_pairFormation,
voidElimination,
universeEquality
Latex:
\mforall{}[C:Type]. \mforall{}[v:Form(C)]. (FormConst?(v) \mmember{} \mBbbB{})
Date html generated:
2018_05_21-PM-11_22_24
Last ObjectModification:
2017_10_13-PM-06_59_04
Theory : PZF
Home
Index