Nuprl Lemma : ts-stable_wf

[ts:transition-system{i:l}]. ∀[P:ts-type(ts) ⟶ ℙ].  (ts-stable(ts;x.P[x]) ∈ ℙ)


Proof




Definitions occuring in Statement :  ts-stable: ts-stable(ts;x.P[x]) ts-type: ts-type(ts) transition-system: transition-system{i:l} uall: [x:A]. B[x] prop: so_apply: x[s] member: t ∈ T function: x:A ⟶ B[x]
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T ts-stable: ts-stable(ts;x.P[x]) so_lambda: λ2x.t[x] implies:  Q prop: so_apply: x[s] infix_ap: y
Lemmas referenced :  all_wf ts-type_wf ts-rel_wf transition-system_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule lemma_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality hypothesis lambdaEquality functionEquality applyEquality axiomEquality equalityTransitivity equalitySymmetry cumulativity universeEquality isect_memberEquality because_Cache

Latex:
\mforall{}[ts:transition-system\{i:l\}].  \mforall{}[P:ts-type(ts)  {}\mrightarrow{}  \mBbbP{}].    (ts-stable(ts;x.P[x])  \mmember{}  \mBbbP{})



Date html generated: 2016_05_15-PM-05_42_46
Last ObjectModification: 2015_12_27-PM-00_30_58

Theory : general


Home Index