Nuprl Lemma : sqntype_nat
∀[n:ℕ]. sqntype(n;ℕ)
Proof
Definitions occuring in Statement :
sqntype: sqntype(n;T),
nat: ℕ,
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
sqntype_subtype_base,
nat_wf,
set_subtype_base,
le_wf,
int_subtype_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
hypothesisEquality,
independent_isectElimination,
sqequalRule,
intEquality,
lambdaEquality,
natural_numberEquality
Latex:
\mforall{}[n:\mBbbN{}]. sqntype(n;\mBbbN{})
Date html generated:
2019_06_20-AM-11_34_12
Last ObjectModification:
2018_08_17-PM-03_55_47
Theory : int_1
Home
Index