Nuprl Lemma : dl-comp?_wf
∀[x:Prog]. (dl-comp?(x) ∈ 𝔹)
Proof
Definitions occuring in Statement :
dl-comp?: dl-comp?(x),
dl-prog: Prog,
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
dl-comp?: dl-comp?(x),
all: ∀x:A. B[x]
Lemmas referenced :
eq_atom_wf,
dl-label_wf,
dl-prog-obj_wf,
dl-prog_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
dependent_functionElimination,
hypothesisEquality,
hypothesis,
tokenEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeIsType
Latex:
\mforall{}[x:Prog]. (dl-comp?(x) \mmember{} \mBbbB{})
Date html generated:
2019_10_15-AM-11_40_08
Last ObjectModification:
2019_03_26-AM-11_24_31
Theory : dynamic!logic
Home
Index