Nuprl Lemma : sub-system_weakening
∀[M:Type ⟶ Type]. ∀S1,S2:System(P.M[P]). sub-system(P.M[P];S1;S2) supposing S1 = S2 ∈ System(P.M[P])
Proof
Definitions occuring in Statement :
sub-system: sub-system(P.M[P];S1;S2),
System: System(P.M[P]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
System: System(P.M[P]),
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
top: Top,
pi2: snd(t),
pi1: fst(t),
sub-system: sub-system(P.M[P];S1;S2),
and: P ∧ Q,
cand: A c∧ B,
prop: ℙ,
ldag: LabeledDAG(T)
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}S1,S2:System(P.M[P]). sub-system(P.M[P];S1;S2) supposing S1 = S2
Date html generated:
2016_05_17-AM-11_03_49
Last ObjectModification:
2015_12_29-PM-05_17_09
Theory : process-model
Home
Index