Nuprl Lemma : lg-contains_weakening
∀[T:Type]. ∀g1,g2:LabeledGraph(T). g1 ⊆ g2 supposing g1 = g2 ∈ LabeledGraph(T)
Proof
Definitions occuring in Statement :
lg-contains: g1 ⊆ g2,
labeled-graph: LabeledGraph(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
lg-contains: g1 ⊆ g2,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
prop: ℙ,
squash: ↓T,
true: True,
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
exists: ∃x:A. B[x]
Latex:
\mforall{}[T:Type]. \mforall{}g1,g2:LabeledGraph(T). g1 \msubseteq{} g2 supposing g1 = g2
Date html generated:
2016_05_17-AM-10_08_29
Last ObjectModification:
2016_01_18-AM-00_23_12
Theory : process-model
Home
Index