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

Theorem cnvcnv 5079
Description: The double converse of a class strips out all elements that are not ordered pairs. (Contributed by NM, 8-Dec-2003.)
Assertion
Ref Expression
cnvcnv  |-  `' `' A  =  ( A  i^i  ( _V  X.  _V ) )

Proof of Theorem cnvcnv
StepHypRef Expression
1 relcnv 5004 . . . . 5  |-  Rel  `' `' A
2 df-rel 4632 . . . . 5  |-  ( Rel  `' `' A  <->  `' `' A  C_  ( _V 
X.  _V ) )
31, 2mpbi 145 . . . 4  |-  `' `' A  C_  ( _V  X.  _V )
4 relxp 4734 . . . . 5  |-  Rel  ( _V  X.  _V )
5 dfrel2 5077 . . . . 5  |-  ( Rel  ( _V  X.  _V ) 
<->  `' `' ( _V  X.  _V )  =  ( _V  X.  _V ) )
64, 5mpbi 145 . . . 4  |-  `' `' ( _V  X.  _V )  =  ( _V  X.  _V )
73, 6sseqtrri 3190 . . 3  |-  `' `' A  C_  `' `' ( _V  X.  _V )
8 dfss 3143 . . 3  |-  ( `' `' A  C_  `' `' ( _V  X.  _V )  <->  `' `' A  =  ( `' `' A  i^i  `' `' ( _V  X.  _V )
) )
97, 8mpbi 145 . 2  |-  `' `' A  =  ( `' `' A  i^i  `' `' ( _V  X.  _V )
)
10 cnvin 5034 . 2  |-  `' ( `' A  i^i  `' ( _V  X.  _V )
)  =  ( `' `' A  i^i  `' `' ( _V  X.  _V )
)
11 cnvin 5034 . . . 4  |-  `' ( A  i^i  ( _V 
X.  _V ) )  =  ( `' A  i^i  `' ( _V  X.  _V ) )
1211cnveqi 4800 . . 3  |-  `' `' ( A  i^i  ( _V  X.  _V ) )  =  `' ( `' A  i^i  `' ( _V  X.  _V )
)
13 inss2 3356 . . . . 5  |-  ( A  i^i  ( _V  X.  _V ) )  C_  ( _V  X.  _V )
14 df-rel 4632 . . . . 5  |-  ( Rel  ( A  i^i  ( _V  X.  _V ) )  <-> 
( A  i^i  ( _V  X.  _V ) ) 
C_  ( _V  X.  _V ) )
1513, 14mpbir 146 . . . 4  |-  Rel  ( A  i^i  ( _V  X.  _V ) )
16 dfrel2 5077 . . . 4  |-  ( Rel  ( A  i^i  ( _V  X.  _V ) )  <->  `' `' ( A  i^i  ( _V  X.  _V )
)  =  ( A  i^i  ( _V  X.  _V ) ) )
1715, 16mpbi 145 . . 3  |-  `' `' ( A  i^i  ( _V  X.  _V ) )  =  ( A  i^i  ( _V  X.  _V )
)
1812, 17eqtr3i 2200 . 2  |-  `' ( `' A  i^i  `' ( _V  X.  _V )
)  =  ( A  i^i  ( _V  X.  _V ) )
199, 10, 183eqtr2i 2204 1  |-  `' `' A  =  ( A  i^i  ( _V  X.  _V ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1353   _Vcvv 2737    i^i cin 3128    C_ wss 3129    X. cxp 4623   `'ccnv 4624   Rel wrel 4630
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-br 4003  df-opab 4064  df-xp 4631  df-rel 4632  df-cnv 4633
This theorem is referenced by:  cnvcnv2  5080  cnvcnvss  5081  structcnvcnv  12469  strslfv2d  12496
  Copyright terms: Public domain W3C validator