Nuprl Lemma : refl_functionality_wrt_iff
∀[T:Type]. ∀[R,R':T ⟶ T ⟶ ℙ]. ((∀x,y:T. (R[x;y] ⇐⇒ R'[x;y])) ⇒ (Refl(T;x,y.R[x;y]) ⇐⇒ Refl(T;x,y.R'[x;y])))
Proof
Definitions occuring in Statement :
refl: Refl(T;x,y.E[x; y]),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
refl: Refl(T;x,y.E[x; y]),
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
iff: P ⇐⇒ Q,
and: P ∧ Q,
all: ∀x:A. B[x],
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s1;s2],
so_apply: x[s],
rev_implies: P ⇐ Q,
guard: {T}
Lemmas referenced :
all_wf,
iff_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
Error :isect_memberFormation_alt,
lambdaFormation,
independent_pairFormation,
hypothesisEquality,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
lambdaEquality,
applyEquality,
hypothesis,
Error :inhabitedIsType,
Error :functionIsType,
Error :universeIsType,
universeEquality,
because_Cache,
dependent_functionElimination,
productElimination,
independent_functionElimination
Latex:
\mforall{}[T:Type]. \mforall{}[R,R':T {}\mrightarrow{} T {}\mrightarrow{} \mBbbP{}].
((\mforall{}x,y:T. (R[x;y] \mLeftarrow{}{}\mRightarrow{} R'[x;y])) {}\mRightarrow{} (Refl(T;x,y.R[x;y]) \mLeftarrow{}{}\mRightarrow{} Refl(T;x,y.R'[x;y])))
Date html generated:
2019_06_20-PM-00_28_43
Last ObjectModification:
2018_09_26-AM-11_46_33
Theory : rel_1
Home
Index