---

Step * of Lemma predicate_equivalent_weakening

∀[T:Type]. ∀[P1,P2:T ⟶ ℙ].  P1 ⇐⇒ P2 supposing P1 = P2 ∈ (T ⟶ ℙ)
BY
{ (Unfold `predicate_equivalent` 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[P1,P2:T  {}\mrightarrow{}  \mBbbP{}].    P1  \mLeftarrow{}{}\mRightarrow{}  P2  supposing  P1  =  P2


By

---

Latex:
(Unfold  `predicate\_equivalent`  0  THEN  Auto)

---

Home Index