MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnvresid Structured version   Visualization version   GIF version

Theorem cnvresid 6568
Description: Converse of a restricted identity function. (Contributed by FL, 4-Mar-2007.)
Assertion
Ref Expression
cnvresid ( I ↾ 𝐴) = ( I ↾ 𝐴)

Proof of Theorem cnvresid
StepHypRef Expression
1 cnvi 5830 . . 3 I = I
21eqcomi 2750 . 2 I = I
3 funi 6521 . . 3 Fun I
4 funeq 6509 . . 3 ( I = I → (Fun I ↔ Fun I ))
53, 4mpbii 235 . 2 ( I = I → Fun I )
6 funcnvres 6567 . . 3 (Fun I → ( I ↾ 𝐴) = ( I ↾ ( I “ 𝐴)))
7 imai 6033 . . . 4 ( I “ 𝐴) = 𝐴
81, 7reseq12i 5936 . . 3 ( I ↾ ( I “ 𝐴)) = ( I ↾ 𝐴)
96, 8eqtrdi 2792 . 2 (Fun I → ( I ↾ 𝐴) = ( I ↾ 𝐴))
102, 5, 9mp2b 10 1 ( I ↾ 𝐴) = ( I ↾ 𝐴)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1548   I cid 5515  ccnv 5620  cres 5623  cima 5624  Fun wfun 6483
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-br 5076  df-opab 5138  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-fun 6491
This theorem is referenced by:  fcoi1  6705  f1oiOLD  6810  relexpcnv  14992  tsrdir  18565  gicref  19242  ssidcn  23242  idqtop  23693  idhmeo  23760  bj-iminvid  37570  ltrncnvnid  40634  dihmeetlem1N  41797  dihglblem5apreN  41798  diophrw  43223  cnvrcl0  44084  relexpaddss  44177  imaidfu  49614
  Copyright terms: Public domain W3C validator