ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnvresid Unicode version

Theorem cnvresid 4993
Description: Converse of a restricted identity function. (Contributed by FL, 4-Mar-2007.)
Assertion
Ref Expression
cnvresid  |-  `' (  _I  |`  A )  =  (  _I  |`  A )

Proof of Theorem cnvresid
StepHypRef Expression
1 cnvi 4748 . . 3  |-  `'  _I  =  _I
21eqcomi 2085 . 2  |-  _I  =  `'  _I
3 funi 4952 . . 3  |-  Fun  _I
4 funeq 4941 . . 3  |-  (  _I  =  `'  _I  ->  ( Fun  _I  <->  Fun  `'  _I  ) )
53, 4mpbii 146 . 2  |-  (  _I  =  `'  _I  ->  Fun  `'  _I  )
6 funcnvres 4992 . . 3  |-  ( Fun  `'  _I  ->  `' (  _I  |`  A )  =  ( `'  _I  |`  (  _I  " A ) ) )
7 imai 4701 . . . 4  |-  (  _I  " A )  =  A
81, 7reseq12i 4628 . . 3  |-  ( `'  _I  |`  (  _I  " A ) )  =  (  _I  |`  A )
96, 8syl6eq 2129 . 2  |-  ( Fun  `'  _I  ->  `' (  _I  |`  A )  =  (  _I  |`  A ) )
102, 5, 9mp2b 8 1  |-  `' (  _I  |`  A )  =  (  _I  |`  A )
Colors of variables: wff set class
Syntax hints:    = wceq 1284    _I cid 4043   `'ccnv 4362    |` cres 4365   "cima 4366   Fun wfun 4916
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-fun 4924
This theorem is referenced by:  fcoi1  5090  f1oi  5184
  Copyright terms: Public domain W3C validator