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
Lemmas :
equal_wf,
labeled-graph_wf,
lg-nil_wf,
lg-nil-append,
lg-append_wf,
squash_wf,
true_wf,
iff_weakening_equal,
lg-append-nil,
exists_wf
Latex:
\mforall{}[T:Type]. \mforall{}g1,g2:LabeledGraph(T). g1 \msubseteq{} g2 supposing g1 = g2
Date html generated:
2015_07_22-PM-00_28_06
Last ObjectModification:
2015_02_04-PM-04_03_30
Home
Index