---

Step * of Lemma mk-rset_wf

∀[P:ℝ ⟶ ℙ]. {x:ℝ | P[x]} ∈ Set(ℝ) supposing ∀x,y:ℝ.  ((x = y) ⇒ P[x] ⇒ P[y])
BY
{ (Unfold `rset` 0 THEN ProveWfLemma THEN MemTypeCD THEN Reduce 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[P:\mBbbR{}  {}\mrightarrow{}  \mBbbP{}].  \{x:\mBbbR{}  |  P[x]\}  \mmember{}  Set(\mBbbR{})  supposing  \mforall{}x,y:\mBbbR{}.    ((x  =  y)  {}\mRightarrow{}  P[x]  {}\mRightarrow{}  P[y])


By

---

Latex:
(Unfold  `rset`  0  THEN  ProveWfLemma  THEN  MemTypeCD  THEN  Reduce  0  THEN  Auto)

---

Home Index