---

Step * of Lemma member-fset-minimals

∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[less:T ⟶ T ⟶ 𝔹]. ∀[s:fset(T)]. ∀[a:T].
  uiff(a ∈ fset-minimals(x,y.less[x;y]; s);a ∈ s ∧ fset-all(s;y.¬bless[y;a]))
BY
{ ((UnivCD THENA Auto)
   THEN Unfold `fset-minimals` 0
   THEN (RWO "member-fset-filter" 0 THENA Auto)
   THEN Unfold `guard` 0
   THEN RWO "assert-fset-minimal" 0
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[eq:EqDecider(T)].  \mforall{}[less:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbB{}].  \mforall{}[s:fset(T)].  \mforall{}[a:T].
    uiff(a  \mmember{}  fset-minimals(x,y.less[x;y];  s);a  \mmember{}  s  \mwedge{}  fset-all(s;y.\mneg{}\msubb{}less[y;a]))


By

---

Latex:
((UnivCD  THENA  Auto)
  THEN  Unfold  `fset-minimals`  0
  THEN  (RWO  "member-fset-filter"  0  THENA  Auto)
  THEN  Unfold  `guard`  0
  THEN  RWO  "assert-fset-minimal"  0
  THEN  Auto)

---

Home Index