---

Step * of Lemma bl-exists_wf

∀[T:Type]. ∀[L:T List]. ∀[P:{x:T| (x ∈ L)}  ⟶ 𝔹].  ((∃x∈L.P[x])_b ∈ 𝔹)
BY
{ (InductionOnList
   THEN Unfold `bl-exists` 0
   THEN Reduce 0
   THEN Try (Fold `bl-exists` 0)
   THEN Auto
   THEN Try (BackThruSomeHyp)
   THEN DSetVars
   THEN MemTypeCD
   THEN Auto
   THEN RWO "cons_member" 0
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[L:T  List].  \mforall{}[P:\{x:T|  (x  \mmember{}  L)\}    {}\mrightarrow{}  \mBbbB{}].    ((\mexists{}x\mmember{}L.P[x])\_b  \mmember{}  \mBbbB{})


By

---

Latex:
(InductionOnList
  THEN  Unfold  `bl-exists`  0
  THEN  Reduce  0
  THEN  Try  (Fold  `bl-exists`  0)
  THEN  Auto
  THEN  Try  (BackThruSomeHyp)
  THEN  DSetVars
  THEN  MemTypeCD
  THEN  Auto
  THEN  RWO  "cons\_member"  0
  THEN  Auto)

---

Home Index