Nuprl Lemma : state-class2-program_wf
∀[Info,A1,A2,B:Type]. ∀[init:Id ⟶ B]. ∀[tr1:Id ⟶ A1 ⟶ B ⟶ B]. ∀[X1:EClass(A1)]. ∀[pr1:LocalClass(X1)]. ∀[tr2:Id
⟶ A2
⟶ B
⟶ B].
∀[X2:EClass(A2)]. ∀[pr2:LocalClass(X2)].
(state-class2-program(init;tr1;pr1;tr2;pr2) ∈ LocalClass(state-class2(init;tr1;X1;tr2;X2))) supposing
(valueall-type(A1) and
valueall-type(A2) and
valueall-type(B) and
(↓B))
Proof
Definitions occuring in Statement :
state-class2-program: state-class2-program(init;tr1;pr1;tr2;pr2),
state-class2: state-class2(init;tr1;X1;tr2;X2),
local-class: LocalClass(X),
eclass: EClass(A[eo; e]),
Id: Id,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
squash: ↓T,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
squash: ↓T,
state-class2-program: state-class2-program(init;tr1;pr1;tr2;pr2),
state-class2: state-class2(init;tr1;X1;tr2;X2),
prop: ℙ,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
exists: ∃x:A. B[x],
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[Info,A1,A2,B:Type]. \mforall{}[init:Id {}\mrightarrow{} B]. \mforall{}[tr1:Id {}\mrightarrow{} A1 {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[X1:EClass(A1)].
\mforall{}[pr1:LocalClass(X1)]. \mforall{}[tr2:Id {}\mrightarrow{} A2 {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[X2:EClass(A2)]. \mforall{}[pr2:LocalClass(X2)].
(state-class2-program(init;tr1;pr1;tr2;pr2)
\mmember{} LocalClass(state-class2(init;tr1;X1;tr2;X2))) supposing
(valueall-type(A1) and
valueall-type(A2) and
valueall-type(B) and
(\mdownarrow{}B))
Date html generated:
2016_05_17-AM-09_11_17
Last ObjectModification:
2016_01_17-PM-09_12_20
Theory : local!classes
Home
Index