---

Step * of Lemma lg-search_wf

∀[T:Type]. ∀[G:LabeledGraph(T)]. ∀[P:T ⟶ 𝔹].  (lg-search(G;x.P[x]) ∈ ℕlg-size(G)?)
BY
{ (Auto THEN Unfold `lg-search` 0 THEN GenConcl ⌜lg-size(G) = n ∈ ℕ⌝⋅ THEN Try (BLemma `lg-size_wf`) THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[G:LabeledGraph(T)].  \mforall{}[P:T  {}\mrightarrow{}  \mBbbB{}].    (lg-search(G;x.P[x])  \mmember{}  \mBbbN{}lg-size(G)?)


By

---

Latex:
(Auto
  THEN  Unfold  `lg-search`  0
  THEN  GenConcl  \mkleeneopen{}lg-size(G)  =  n\mkleeneclose{}\mcdot{}
  THEN  Try  (BLemma  `lg-size\_wf`)
  THEN  Auto)

---

Home Index