Nuprl Lemma : sub-system-append
∀[M:Type ⟶ Type]. ∀S1,S2:System(P.M[P]). (sub-system(P.M[P];S1;S1 @ S2) ∧ sub-system(P.M[P];S2;S1 @ S2))
Proof
Definitions occuring in Statement :
system-append: S1 @ S2,
sub-system: sub-system(P.M[P];S1;S2),
System: System(P.M[P]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
and: P ∧ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
System: System(P.M[P]),
system-append: S1 @ S2,
sub-system: sub-system(P.M[P];S1;S2),
member: t ∈ T,
so_lambda: λ2x.t[x],
so_apply: x[s],
ldag: LabeledDAG(T)
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]
\mforall{}S1,S2:System(P.M[P]). (sub-system(P.M[P];S1;S1 @ S2) \mwedge{} sub-system(P.M[P];S2;S1 @ S2))
Date html generated:
2016_05_17-AM-11_04_03
Last ObjectModification:
2015_12_29-PM-05_16_52
Theory : process-model
Home
Index