Nuprl Lemma : subterm-rel_wf
∀[opr:Type]. (subterm-rel(opr) ∈ term(opr) ⟶ term(opr) ⟶ ℙ)
Proof
Definitions occuring in Statement :
subterm-rel: subterm-rel(opr),
term: term(opr),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subterm-rel: subterm-rel(opr)
Lemmas referenced :
transitive-closure_wf,
term_wf,
immediate-subterm_wf,
istype-universe
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
lambdaEquality_alt,
inhabitedIsType,
universeIsType,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
instantiate,
universeEquality
Latex:
\mforall{}[opr:Type]. (subterm-rel(opr) \mmember{} term(opr) {}\mrightarrow{} term(opr) {}\mrightarrow{} \mBbbP{})
Date html generated:
2020_05_19-PM-09_54_07
Last ObjectModification:
2020_03_09-PM-04_27_11
Theory : terms
Home
Index