Nuprl Lemma : dl-valid-induction-ax
∀a:Prog. ∀phi:Prop. (|= phi ∧ [(a)*] phi ⇒ [a] phi ⇒ |= [(a)*] phi)
Proof
Definitions occuring in Statement :
dl-valid: |= phi,
dl-box: [x1] x,
dl-and: x1 ∧ x,
dl-implies: x1 ⇒ x,
dl-iterate: (x)*,
dl-prop: Prop,
dl-prog: Prog,
all: ∀x:A. B[x],
implies: P ⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
dl-valid: Error :dl-valid,
dl-sem: Error :dl-sem,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
member: t ∈ T,
top: Top,
so_apply: x[s],
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
and: P ∧ Q,
pi1: fst(t),
subtype_rel: A ⊆r B,
prop: ℙ
Lemmas referenced :
istype-void,
rel_star_wf,
istype-atom,
subtype_rel_self,
istype-universe
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation_alt,
sqequalHypSubstitution,
sqequalRule,
cut,
introduction,
extract_by_obid,
isectElimination,
thin,
isect_memberEquality_alt,
voidElimination,
hypothesis,
dependent_functionElimination,
hypothesisEquality,
productElimination,
universeIsType,
applyEquality,
lambdaEquality_alt,
inhabitedIsType,
equalityIstype,
equalityTransitivity,
equalitySymmetry,
independent_functionElimination,
instantiate,
universeEquality,
because_Cache,
functionIsType
Latex:
\mforall{}a:Prog. \mforall{}phi:Prop. (|= phi \mwedge{} [(a)*] phi {}\mRightarrow{} [a] phi {}\mRightarrow{} |= [(a)*] phi)
Date html generated:
2019_10_15-AM-11_45_36
Last ObjectModification:
2019_03_26-AM-11_28_49
Theory : dynamic!logic
Home
Index