---

Step * of Lemma rel_exp_functionality_wrt_breqv

∀n:ℕ. ∀[T:Type]. ∀[R1,R2:T ⟶ T ⟶ ℙ].  ((R1 <≡>{T} R2) ⇒ (R1^n <≡>{T} R2^n))
BY
{ (Auto
   THEN (BLemma `binrel_le_antisymmetry` THENA Auto)
   THEN (BLemma `rel_exp_functionality_wrt_brle` THENA Auto)
   THEN RelRST
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}n:\mBbbN{}
    \mforall{}[T:Type].  \mforall{}[R1,R2:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].    ((R1  <\mequiv{}>\{T\}  R2)  {}\mRightarrow{}  (R1\^{}n  <\mequiv{}>\{T\}  R2\^{}n))


By

---

Latex:
(Auto
  THEN  (BLemma  `binrel\_le\_antisymmetry`  THENA  Auto)
  THEN  (BLemma  `rel\_exp\_functionality\_wrt\_brle`  THENA  Auto)
  THEN  RelRST
  THEN  Auto)

---

Home Index