Nuprl Lemma : rec-bind-class-arg_wf
∀[Info,A,B:Type]. ∀[X:A ⟶ EClass(B)]. ∀[Y:A ⟶ EClass(A)]. ∀[a:A].
rec-bind-class-arg(X;Y;a) ∈ EClass(B) supposing not-self-starting{i:l}(Info;A;Y)
Proof
Definitions occuring in Statement :
rec-bind-class-arg: rec-bind-class-arg(X;Y;a),
not-self-starting: not-self-starting{i:l}(Info;A;Y),
eclass: EClass(A[eo; e]),
uimplies: b supposing a,
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,
uimplies: b supposing a,
rec-bind-class-arg: rec-bind-class-arg(X;Y;a),
prop: ℙ,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2]
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[X:A {}\mrightarrow{} EClass(B)]. \mforall{}[Y:A {}\mrightarrow{} EClass(A)]. \mforall{}[a:A].
rec-bind-class-arg(X;Y;a) \mmember{} EClass(B) supposing not-self-starting\{i:l\}(Info;A;Y)
Date html generated:
2016_05_17-AM-00_32_42
Last ObjectModification:
2015_12_29-AM-00_37_51
Theory : event-ordering
Home
Index