Nuprl Lemma : linorder_wf
∀[T:Type]. ∀[R:T ⟶ T ⟶ ℙ]. (Linorder(T;x,y.R[x;y]) ∈ ℙ)
Proof
Definitions occuring in Statement :
linorder: Linorder(T;x,y.R[x; y]),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
linorder: Linorder(T;x,y.R[x; y]),
prop: ℙ,
and: P ∧ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Lemmas referenced :
order_wf,
connex_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
introduction,
cut,
sqequalRule,
productEquality,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
lambdaEquality,
applyEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
Error :functionIsType,
Error :universeIsType,
Error :inhabitedIsType,
universeEquality,
isect_memberEquality,
functionEquality,
cumulativity
Latex:
\mforall{}[T:Type]. \mforall{}[R:T {}\mrightarrow{} T {}\mrightarrow{} \mBbbP{}]. (Linorder(T;x,y.R[x;y]) \mmember{} \mBbbP{})
Date html generated:
2019_06_20-PM-00_29_34
Last ObjectModification:
2018_09_26-AM-11_48_18
Theory : rel_1
Home
Index