Nuprl Lemma : decidable__node_complete2
∀n:node. ∀d:EqDecider(Prop). Dec(node_complete{i:l}(n))
Proof
Definitions occuring in Statement :
node_complete: node_complete{i:l}(n),
node: node,
dl-prop: Prop,
deq: EqDecider(T),
decidable: Dec(P),
all: ∀x:A. B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
implies: P ⇒ Q,
uall: ∀[x:A]. B[x]
Lemmas referenced :
decidable__node_complete,
decidable-equal-deq,
dl-prop_wf,
deq_wf,
node_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation_alt,
cut,
introduction,
extract_by_obid,
hypothesis,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
independent_functionElimination,
isectElimination,
inhabitedIsType,
universeIsType
Latex:
\mforall{}n:node. \mforall{}d:EqDecider(Prop). Dec(node\_complete\{i:l\}(n))
Date html generated:
2020_05_20-AM-09_02_10
Last ObjectModification:
2019_11_27-PM-02_29_56
Theory : dynamic!logic
Home
Index