---

Step * 1 of Lemma assert-bl-all

.....assertion..... 
∀[T:Type]. ∀[P:T ⟶ 𝔹]. ∀[L:T List].  uiff(↑(∀x∈L.P[x])_b;(∀x∈L.↑P[x]))
BY
{ (InductionOnList
   THEN Unfold `bl-all` 0
   THEN Reduce 0
   THEN Try (Fold `bl-all` 0)
   THEN Auto
   THEN (All (RWO "l_all_cons") THEN Auto)⋅) }

---

Latex:

---

Latex:
.....assertion..... 
\mforall{}[T:Type].  \mforall{}[P:T  {}\mrightarrow{}  \mBbbB{}].  \mforall{}[L:T  List].    uiff(\muparrow{}(\mforall{}x\mmember{}L.P[x])\_b;(\mforall{}x\mmember{}L.\muparrow{}P[x]))


By

---

Latex:
(InductionOnList
  THEN  Unfold  `bl-all`  0
  THEN  Reduce  0
  THEN  Try  (Fold  `bl-all`  0)
  THEN  Auto
  THEN  (All  (RWO  "l\_all\_cons")  THEN  Auto)\mcdot{})

---

Home Index