Nuprl Lemma : iseg_wf
∀[T:Type]. ∀[l1,l2:T List]. (l1 ≤ l2 ∈ ℙ)
Proof
Definitions occuring in Statement :
iseg: l1 ≤ l2,
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
iseg: l1 ≤ l2,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
exists_wf,
list_wf,
equal_wf,
append_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
lambdaEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
Error :inhabitedIsType,
isect_memberEquality,
Error :universeIsType,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[l1,l2:T List]. (l1 \mleq{} l2 \mmember{} \mBbbP{})
Date html generated:
2019_06_20-PM-01_27_56
Last ObjectModification:
2018_09_26-PM-05_31_19
Theory : list_1
Home
Index