Nuprl Lemma : lg-contains_antisymmetry
∀[T:Type]. ∀[g1,g2:LabeledGraph(T)]. (g1 = g2 ∈ LabeledGraph(T)) supposing (g2 ⊆ g1 and g1 ⊆ g2)
Proof
Definitions occuring in Statement :
lg-contains: g1 ⊆ g2,
labeled-graph: LabeledGraph(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Lemmas :
lg-size_wf,
nat_wf,
exists_wf,
labeled-graph_wf,
equal_wf,
lg-append_wf,
lg-size-append,
add_functionality_wrt_eq,
iff_weakening_equal,
lg-size-nil,
squash_wf,
true_wf,
lg-nil_wf,
lg-nil-append,
lg-append-nil
Latex:
\mforall{}[T:Type]. \mforall{}[g1,g2:LabeledGraph(T)]. (g1 = g2) supposing (g2 \msubseteq{} g1 and g1 \msubseteq{} g2)
Date html generated:
2015_07_22-PM-00_28_32
Last ObjectModification:
2015_02_04-PM-04_03_01
Home
Index