Nuprl Lemma : lg-is-source_wf

[T:Type]. ∀[g:LabeledGraph(T)]. ∀[i:ℕ].  (lg-is-source(g;i) ∈ 𝔹)


Proof




Definitions occuring in Statement :  lg-is-source: lg-is-source(g;i) labeled-graph: LabeledGraph(T) nat: bool: 𝔹 uall: [x:A]. B[x] member: t ∈ T universe: Type
Lemmas :  lt_int_wf lg-size_wf bool_wf uiff_transitivity equal-wf-T-base assert_wf less_than_wf eqtt_to_assert assert_of_lt_int null_wf3 lg-in-edges_wf lelt_wf subtype_rel_list int_seg_wf top_wf le_int_wf le_wf bnot_wf eqff_to_assert assert_functionality_wrt_uiff bnot_of_lt_int assert_of_le_int bfalse_wf nat_wf labeled-graph_wf

Latex:
\mforall{}[T:Type].  \mforall{}[g:LabeledGraph(T)].  \mforall{}[i:\mBbbN{}].    (lg-is-source(g;i)  \mmember{}  \mBbbB{})



Date html generated: 2015_07_22-PM-00_29_30
Last ObjectModification: 2015_01_28-PM-11_33_00

Home Index