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

Theorem cnviinm 5285
Description: The converse of an intersection is the intersection of the converse. (Contributed by Jim Kingdon, 18-Dec-2018.)
Assertion
Ref Expression
cnviinm  |-  ( E. y  y  e.  A  ->  `' |^|_ x  e.  A  B  =  |^|_ x  e.  A  `' B )
Distinct variable groups:    x, A    y, A
Allowed substitution hints:    B( x, y)

Proof of Theorem cnviinm
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1w 2292 . . 3  |-  ( y  =  a  ->  (
y  e.  A  <->  a  e.  A ) )
21cbvexv 1967 . 2  |-  ( E. y  y  e.  A  <->  E. a  a  e.  A
)
3 eleq1w 2292 . . . 4  |-  ( x  =  a  ->  (
x  e.  A  <->  a  e.  A ) )
43cbvexv 1967 . . 3  |-  ( E. x  x  e.  A  <->  E. a  a  e.  A
)
5 relcnv 5121 . . . 4  |-  Rel  `' |^|_
x  e.  A  B
6 r19.2m 3583 . . . . . . . 8  |-  ( ( E. x  x  e.  A  /\  A. x  e.  A  `' B  C_  ( _V  X.  _V ) )  ->  E. x  e.  A  `' B  C_  ( _V  X.  _V ) )
76expcom 116 . . . . . . 7  |-  ( A. x  e.  A  `' B  C_  ( _V  X.  _V )  ->  ( E. x  x  e.  A  ->  E. x  e.  A  `' B  C_  ( _V 
X.  _V ) ) )
8 relcnv 5121 . . . . . . . . 9  |-  Rel  `' B
9 df-rel 4738 . . . . . . . . 9  |-  ( Rel  `' B  <->  `' B  C_  ( _V 
X.  _V ) )
108, 9mpbi 145 . . . . . . . 8  |-  `' B  C_  ( _V  X.  _V )
1110a1i 9 . . . . . . 7  |-  ( x  e.  A  ->  `' B  C_  ( _V  X.  _V ) )
127, 11mprg 2590 . . . . . 6  |-  ( E. x  x  e.  A  ->  E. x  e.  A  `' B  C_  ( _V 
X.  _V ) )
13 iinss 4027 . . . . . 6  |-  ( E. x  e.  A  `' B  C_  ( _V  X.  _V )  ->  |^|_ x  e.  A  `' B  C_  ( _V  X.  _V ) )
1412, 13syl 14 . . . . 5  |-  ( E. x  x  e.  A  -> 
|^|_ x  e.  A  `' B  C_  ( _V 
X.  _V ) )
15 df-rel 4738 . . . . 5  |-  ( Rel  |^|_ x  e.  A  `' B 
<-> 
|^|_ x  e.  A  `' B  C_  ( _V 
X.  _V ) )
1614, 15sylibr 134 . . . 4  |-  ( E. x  x  e.  A  ->  Rel  |^|_ x  e.  A  `' B )
17 vex 2806 . . . . . . . 8  |-  b  e. 
_V
18 vex 2806 . . . . . . . 8  |-  a  e. 
_V
1917, 18opex 4327 . . . . . . 7  |-  <. b ,  a >.  e.  _V
20 eliin 3980 . . . . . . 7  |-  ( <.
b ,  a >.  e.  _V  ->  ( <. b ,  a >.  e.  |^|_ x  e.  A  B  <->  A. x  e.  A  <. b ,  a >.  e.  B
) )
2119, 20ax-mp 5 . . . . . 6  |-  ( <.
b ,  a >.  e.  |^|_ x  e.  A  B 
<-> 
A. x  e.  A  <. b ,  a >.  e.  B )
2218, 17opelcnv 4918 . . . . . 6  |-  ( <.
a ,  b >.  e.  `' |^|_ x  e.  A  B 
<-> 
<. b ,  a >.  e.  |^|_ x  e.  A  B )
2318, 17opex 4327 . . . . . . . 8  |-  <. a ,  b >.  e.  _V
24 eliin 3980 . . . . . . . 8  |-  ( <.
a ,  b >.  e.  _V  ->  ( <. a ,  b >.  e.  |^|_ x  e.  A  `' B  <->  A. x  e.  A  <. a ,  b >.  e.  `' B ) )
2523, 24ax-mp 5 . . . . . . 7  |-  ( <.
a ,  b >.  e.  |^|_ x  e.  A  `' B  <->  A. x  e.  A  <. a ,  b >.  e.  `' B )
2618, 17opelcnv 4918 . . . . . . . 8  |-  ( <.
a ,  b >.  e.  `' B  <->  <. b ,  a
>.  e.  B )
2726ralbii 2539 . . . . . . 7  |-  ( A. x  e.  A  <. a ,  b >.  e.  `' B 
<-> 
A. x  e.  A  <. b ,  a >.  e.  B )
2825, 27bitri 184 . . . . . 6  |-  ( <.
a ,  b >.  e.  |^|_ x  e.  A  `' B  <->  A. x  e.  A  <. b ,  a >.  e.  B )
2921, 22, 283bitr4i 212 . . . . 5  |-  ( <.
a ,  b >.  e.  `' |^|_ x  e.  A  B 
<-> 
<. a ,  b >.  e.  |^|_ x  e.  A  `' B )
3029eqrelriv 4825 . . . 4  |-  ( ( Rel  `' |^|_ x  e.  A  B  /\  Rel  |^|_ x  e.  A  `' B )  ->  `' |^|_
x  e.  A  B  =  |^|_ x  e.  A  `' B )
315, 16, 30sylancr 414 . . 3  |-  ( E. x  x  e.  A  ->  `' |^|_ x  e.  A  B  =  |^|_ x  e.  A  `' B )
324, 31sylbir 135 . 2  |-  ( E. a  a  e.  A  ->  `' |^|_ x  e.  A  B  =  |^|_ x  e.  A  `' B )
332, 32sylbi 121 1  |-  ( E. y  y  e.  A  ->  `' |^|_ x  e.  A  B  =  |^|_ x  e.  A  `' B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2202   A.wral 2511   E.wrex 2512   _Vcvv 2803    C_ wss 3201   <.cop 3676   |^|_ciin 3976    X. cxp 4729   `'ccnv 4730   Rel wrel 4736
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-iin 3978  df-br 4094  df-opab 4156  df-xp 4737  df-rel 4738  df-cnv 4739
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator