MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pmtrfcnv Structured version   Unicode version

Theorem pmtrfcnv 16282
Description: A transposition function is its own inverse. (Contributed by Stefan O'Rear, 22-Aug-2015.)
Hypotheses
Ref Expression
pmtrrn.t  |-  T  =  (pmTrsp `  D )
pmtrrn.r  |-  R  =  ran  T
Assertion
Ref Expression
pmtrfcnv  |-  ( F  e.  R  ->  `' F  =  F )

Proof of Theorem pmtrfcnv
StepHypRef Expression
1 pmtrrn.t . . . . . . 7  |-  T  =  (pmTrsp `  D )
2 pmtrrn.r . . . . . . 7  |-  R  =  ran  T
3 eqid 2467 . . . . . . 7  |-  dom  ( F  \  _I  )  =  dom  ( F  \  _I  )
41, 2, 3pmtrfrn 16276 . . . . . 6  |-  ( F  e.  R  ->  (
( D  e.  _V  /\ 
dom  ( F  \  _I  )  C_  D  /\  dom  ( F  \  _I  )  ~~  2o )  /\  F  =  ( T `  dom  ( F  \  _I  ) ) ) )
54simpld 459 . . . . 5  |-  ( F  e.  R  ->  ( D  e.  _V  /\  dom  ( F  \  _I  )  C_  D  /\  dom  ( F  \  _I  )  ~~  2o ) )
61pmtrf 16273 . . . . 5  |-  ( ( D  e.  _V  /\  dom  ( F  \  _I  )  C_  D  /\  dom  ( F  \  _I  )  ~~  2o )  ->  ( T `  dom  ( F 
\  _I  ) ) : D --> D )
75, 6syl 16 . . . 4  |-  ( F  e.  R  ->  ( T `  dom  ( F 
\  _I  ) ) : D --> D )
84simprd 463 . . . . 5  |-  ( F  e.  R  ->  F  =  ( T `  dom  ( F  \  _I  ) ) )
98feq1d 5715 . . . 4  |-  ( F  e.  R  ->  ( F : D --> D  <->  ( T `  dom  ( F  \  _I  ) ) : D --> D ) )
107, 9mpbird 232 . . 3  |-  ( F  e.  R  ->  F : D --> D )
111, 2pmtrfinv 16279 . . 3  |-  ( F  e.  R  ->  ( F  o.  F )  =  (  _I  |`  D ) )
12 fcof1o 6185 . . 3  |-  ( ( ( F : D --> D  /\  F : D --> D )  /\  (
( F  o.  F
)  =  (  _I  |`  D )  /\  ( F  o.  F )  =  (  _I  |`  D ) ) )  ->  ( F : D -1-1-onto-> D  /\  `' F  =  F ) )
1310, 10, 11, 11, 12syl22anc 1229 . 2  |-  ( F  e.  R  ->  ( F : D -1-1-onto-> D  /\  `' F  =  F ) )
1413simprd 463 1  |-  ( F  e.  R  ->  `' F  =  F )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767   _Vcvv 3113    \ cdif 3473    C_ wss 3476   class class class wbr 4447    _I cid 4790   `'ccnv 4998   dom cdm 4999   ran crn 5000    |` cres 5001    o. ccom 5003   -->wf 5582   -1-1-onto->wf1o 5585   ` cfv 5586   2oc2o 7121    ~~ cen 7510  pmTrspcpmtr 16259
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4558  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6574
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-reu 2821  df-rab 2823  df-v 3115  df-sbc 3332  df-csb 3436  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-pss 3492  df-nul 3786  df-if 3940  df-pw 4012  df-sn 4028  df-pr 4030  df-tp 4032  df-op 4034  df-uni 4246  df-iun 4327  df-br 4448  df-opab 4506  df-mpt 4507  df-tr 4541  df-eprel 4791  df-id 4795  df-po 4800  df-so 4801  df-fr 4838  df-we 4840  df-ord 4881  df-on 4882  df-lim 4883  df-suc 4884  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5549  df-fun 5588  df-fn 5589  df-f 5590  df-f1 5591  df-fo 5592  df-f1o 5593  df-fv 5594  df-om 6679  df-1o 7127  df-2o 7128  df-er 7308  df-en 7514  df-dom 7515  df-sdom 7516  df-fin 7517  df-pmtr 16260
This theorem is referenced by:  symgtrinv  16290  psgnunilem1  16311
  Copyright terms: Public domain W3C validator