---

Step * of Lemma rv-congruent-trans

∀[n:ℕ]. ∀[a,b,p,q,r,s:ℝ^n].  (pq=rs) supposing (ab=rs and ab=pq)
BY
{ (Unfold `rv-congruent` 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[n:\mBbbN{}].  \mforall{}[a,b,p,q,r,s:\mBbbR{}\^{}n].    (pq=rs)  supposing  (ab=rs  and  ab=pq)


By

---

Latex:
(Unfold  `rv-congruent`  0  THEN  Auto)

---

Home Index