---

Step * 2 of Lemma biject-iff-inverse


1. [A] : Type
2. [B] : Type
3. f : A ⟶ B@i
4. Bij(A;B;f)@i
⊢ ∃g:B ⟶ A. InvFuns(A;B;f;g)
BY
{ (BLemma `biject-inverse2` THEN Auto) }

---

Latex:

---

Latex:

1.  [A]  :  Type
2.  [B]  :  Type
3.  f  :  A  {}\mrightarrow{}  B@i
4.  Bij(A;B;f)@i
\mvdash{}  \mexists{}g:B  {}\mrightarrow{}  A.  InvFuns(A;B;f;g)


By

---

Latex:
(BLemma  `biject-inverse2`  THEN  Auto)

---

Home Index