Metamath Proof Explorer


Theorem cnvresid

Description: A restricted identity relation is equal to its converse. (Contributed by FL, 4-Mar-2007) Remove dependency on ax-12 and shorten. (Revised by BJ, 1-Nov-2026)

Ref Expression
Assertion cnvresid ⊢ I ↾ A -1 = I ↾ A

Proof

Step Hyp Ref Expression
1 cnvin ⊢ I ∩ A × A -1 = I -1 ∩ A × A -1
2 cnvi ⊢ I -1 = I
3 cnvxp ⊢ A × A -1 = A × A
4 2 3 ineq12i ⊢ I -1 ∩ A × A -1 = I ∩ A × A
5 1 4 eqtri ⊢ I ∩ A × A -1 = I ∩ A × A
6 idinxpresid ⊢ I ∩ A × A = I ↾ A
7 6 cnveqi ⊢ I ∩ A × A -1 = I ↾ A -1
8 5 7 6 3eqtr3i ⊢ I ↾ A -1 = I ↾ A