Nuprl Lemma : bool-to-neg-dcdr-aux
∀[A:Type]. ∀f:A ⟶ 𝔹. ∀x:A. Dec(f x = ff)
Proof
Definitions occuring in Statement :
bfalse: ff,
bool: 𝔹,
decidable: Dec(P),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
member: t ∈ T
Lemmas referenced :
decidable__equal_bool,
bfalse_wf,
bool_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
applyEquality,
hypothesisEquality,
hypothesis,
functionEquality,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}f:A {}\mrightarrow{} \mBbbB{}. \mforall{}x:A. Dec(f x = ff)
Date html generated:
2016_05_15-PM-03_27_49
Last ObjectModification:
2015_12_27-PM-01_08_55
Theory : general
Home
Index