---

Step * of Lemma per-set-intro

∀[A:Type]. ∀[B:A ⟶ Type]. ∀[a:A].  a ∈ per-set(A;a.B[a]) supposing B[a]
BY
{ (Intros THEN InstLemma `per-set-equality` [⌜A⌝;⌜B⌝;⌜a⌝;⌜a⌝]⋅ THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A:Type].  \mforall{}[B:A  {}\mrightarrow{}  Type].  \mforall{}[a:A].    a  \mmember{}  per-set(A;a.B[a])  supposing  B[a]


By

---

Latex:
(Intros  THEN  InstLemma  `per-set-equality`  [\mkleeneopen{}A\mkleeneclose{};\mkleeneopen{}B\mkleeneclose{};\mkleeneopen{}a\mkleeneclose{};\mkleeneopen{}a\mkleeneclose{}]\mcdot{}  THEN  Auto)

---

Home Index