Nuprl Lemma : lg-contains_transitivity
∀[T:Type]. ∀g1,g2,g3:LabeledGraph(T). (g1 ⊆ g2 ⇒ g2 ⊆ g3 ⇒ g1 ⊆ g3)
Proof
Definitions occuring in Statement :
lg-contains: g1 ⊆ g2,
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Definitions unfolded in proof :
lg-contains: g1 ⊆ g2,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
exists: ∃x:A. B[x],
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[T:Type]. \mforall{}g1,g2,g3:LabeledGraph(T). (g1 \msubseteq{} g2 {}\mRightarrow{} g2 \msubseteq{} g3 {}\mRightarrow{} g1 \msubseteq{} g3)
Date html generated:
2016_05_17-AM-10_08_27
Last ObjectModification:
2015_12_29-PM-05_34_34
Theory : process-model
Home
Index