Nuprl Lemma : header-type-spec_wf

[L:Name List]. ∀[g:Name ⟶ Type].  (header-type-spec{i:l}(L;g) ∈ 𝕌')


Proof




Definitions occuring in Statement :  header-type-spec: header-type-spec{i:l}(L;g) name: Name list: List uall: [x:A]. B[x] member: t ∈ T function: x:A ⟶ B[x] universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T header-type-spec: header-type-spec{i:l}(L;g) l_all: (∀x∈L.P[x]) subtype_rel: A ⊆B and: P ∧ Q prop: so_lambda: λ2x.t[x] int_seg: {i..j-} uimplies: supposing a guard: {T} lelt: i ≤ j < k all: x:A. B[x] decidable: Dec(P) or: P ∨ Q satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False implies:  Q not: ¬A top: Top less_than: a < b squash: T so_apply: x[s]

Latex:
\mforall{}[L:Name  List].  \mforall{}[g:Name  {}\mrightarrow{}  Type].    (header-type-spec\{i:l\}(L;g)  \mmember{}  \mBbbU{}')



Date html generated: 2016_05_17-AM-08_49_56
Last ObjectModification: 2016_01_17-PM-08_35_29

Theory : messages


Home Index