Nuprl Lemma : fin_type_wf
∀s:DSet. ∀as:|s| List. ({as} ∈ Type)
Proof
Definitions occuring in Statement :
fin_type: {as},
list: T List,
all: ∀x:A. B[x],
member: t ∈ T,
universe: Type,
dset: DSet,
set_car: |p|
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
fin_type: {as},
uall: ∀[x:A]. B[x],
dset: DSet,
prop: ℙ
Lemmas referenced :
set_car_wf,
assert_wf,
mem_wf,
list_wf,
dset_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation_alt,
cut,
sqequalRule,
setEquality,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
setElimination,
rename,
because_Cache,
hypothesis,
dependent_functionElimination,
hypothesisEquality,
universeIsType
Latex:
\mforall{}s:DSet. \mforall{}as:|s| List. (\{as\} \mmember{} Type)
Date html generated:
2019_10_16-PM-01_05_39
Last ObjectModification:
2018_10_08-AM-10_18_09
Theory : list_2
Home
Index