HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem cnvresid 3561
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 3439 . . . 4 |- `'I = I
21eqcomi 1476 . . 3 |- I = `'I
3 funi 3537 . . . 4 |- Fun I
4 funeq 3527 . . . 4 |- (I = `'I -> (Fun I <-> Fun `'I))
53, 4mpbii 193 . . 3 |- (I = `'I -> Fun `'I)
62, 5ax-mp 7 . 2 |- Fun `'I
7 funcnvres 3560 . . 3 |- (Fun `'I -> `'(I |` A) = (`'I |` (I"A)))
8 reseq1 3360 . . . . 5 |- (`'I = I -> (`'I |` (I"A)) = (I |` (I"A)))
9 imai 3409 . . . . . 6 |- (I"A) = A
10 reseq2 3361 . . . . . 6 |- ((I"A) = A -> (I |` (I"A)) = (I |` A))
119, 10ax-mp 7 . . . . 5 |- (I |` (I"A)) = (I |` A)
128, 11syl6eq 1520 . . . 4 |- (`'I = I -> (`'I |` (I"A)) = (I |` A))
131, 12ax-mp 7 . . 3 |- (`'I |` (I"A)) = (I |` A)
147, 13syl6eq 1520 . 2 |- (Fun `'I -> `'(I |` A) = (I |` A))
156, 14ax-mp 7 1 |- `'(I |` A) = (I |` A)
Colors of variables: wff set class
Syntax hints:   = wceq 954  Icid 2826  `'ccnv 3164   |` cres 3167  "cima 3168  Fun wfun 3171
This theorem is referenced by:  idhme 10445  hmphre 10453
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-br 2615  df-opab 2662  df-id 2830  df-xp 3179  df-rel 3180  df-cnv 3181  df-co 3182  df-dm 3183  df-rn 3184  df-res 3185  df-ima 3186  df-fun 3187
Copyright terms: Public domain