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

Theorem cnvresid 6436
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 6003 . . 3 I = I
21eqcomi 2833 . 2 I = I
3 funi 6390 . . 3 Fun I
4 funeq 6378 . . 3 ( I = I → (Fun I ↔ Fun I ))
53, 4mpbii 235 . 2 ( I = I → Fun I )
6 funcnvres 6435 . . 3 (Fun I → ( I ↾ 𝐴) = ( I ↾ ( I “ 𝐴)))
7 imai 5945 . . . 4 ( I “ 𝐴) = 𝐴
81, 7reseq12i 5854 . . 3 ( I ↾ ( I “ 𝐴)) = ( I ↾ 𝐴)
96, 8syl6eq 2875 . 2 (Fun I → ( I ↾ 𝐴) = ( I ↾ 𝐴))
102, 5, 9mp2b 10 1 ( I ↾ 𝐴) = ( I ↾ 𝐴)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1536   I cid 5462  ccnv 5557  cres 5560  cima 5561  Fun wfun 6352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-br 5070  df-opab 5132  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-fun 6360
This theorem is referenced by:  fcoi1  6555  f1oi  6655  relexpcnv  14397  tsrdir  17851  gicref  18414  ssidcn  21866  idqtop  22317  idhmeo  22384  ltrncnvnid  37267  dihmeetlem1N  38430  dihglblem5apreN  38431  diophrw  39362  cnvrcl0  39991  relexpaddss  40069
  Copyright terms: Public domain W3C validator