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

Theorem cnvf1olem 6232
Description: Lemma for cnvf1o 6233. (Contributed by Mario Carneiro, 27-Apr-2014.)
Assertion
Ref Expression
cnvf1olem  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  -> 
( C  e.  `' A  /\  B  =  U. `' { C } ) )

Proof of Theorem cnvf1olem
StepHypRef Expression
1 simprr 733 . . . . 5  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  C  =  U. `' { B } )
2 1st2nd 6182 . . . . . . . . 9  |-  ( ( Rel  A  /\  B  e.  A )  ->  B  =  <. ( 1st `  B
) ,  ( 2nd `  B ) >. )
32adantrr 697 . . . . . . . 8  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  B  =  <. ( 1st `  B ) ,  ( 2nd `  B )
>. )
43sneqd 3666 . . . . . . 7  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  { B }  =  { <. ( 1st `  B
) ,  ( 2nd `  B ) >. } )
54cnveqd 4873 . . . . . 6  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  `' { B }  =  `' { <. ( 1st `  B
) ,  ( 2nd `  B ) >. } )
65unieqd 3854 . . . . 5  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  U. `' { B }  =  U. `' { <. ( 1st `  B
) ,  ( 2nd `  B ) >. } )
71, 6eqtrd 2328 . . . 4  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  C  =  U. `' { <. ( 1st `  B
) ,  ( 2nd `  B ) >. } )
8 opswap 5175 . . . 4  |-  U. `' { <. ( 1st `  B
) ,  ( 2nd `  B ) >. }  =  <. ( 2nd `  B
) ,  ( 1st `  B ) >.
97, 8syl6eq 2344 . . 3  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  C  =  <. ( 2nd `  B ) ,  ( 1st `  B )
>. )
10 simprl 732 . . . . 5  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  B  e.  A )
113, 10eqeltrrd 2371 . . . 4  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  <. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  A
)
12 fvex 5555 . . . . 5  |-  ( 2nd `  B )  e.  _V
13 fvex 5555 . . . . 5  |-  ( 1st `  B )  e.  _V
1412, 13opelcnv 4879 . . . 4  |-  ( <.
( 2nd `  B
) ,  ( 1st `  B ) >.  e.  `' A 
<-> 
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  A
)
1511, 14sylibr 203 . . 3  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  <. ( 2nd `  B
) ,  ( 1st `  B ) >.  e.  `' A )
169, 15eqeltrd 2370 . 2  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  C  e.  `' A
)
17 opswap 5175 . . . 4  |-  U. `' { <. ( 2nd `  B
) ,  ( 1st `  B ) >. }  =  <. ( 1st `  B
) ,  ( 2nd `  B ) >.
1817eqcomi 2300 . . 3  |-  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  =  U. `' { <. ( 2nd `  B
) ,  ( 1st `  B ) >. }
199sneqd 3666 . . . . 5  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  { C }  =  { <. ( 2nd `  B
) ,  ( 1st `  B ) >. } )
2019cnveqd 4873 . . . 4  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  `' { C }  =  `' { <. ( 2nd `  B
) ,  ( 1st `  B ) >. } )
2120unieqd 3854 . . 3  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  U. `' { C }  =  U. `' { <. ( 2nd `  B
) ,  ( 1st `  B ) >. } )
2218, 3, 213eqtr4a 2354 . 2  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  ->  B  =  U. `' { C } )
2316, 22jca 518 1  |-  ( ( Rel  A  /\  ( B  e.  A  /\  C  =  U. `' { B } ) )  -> 
( C  e.  `' A  /\  B  =  U. `' { C } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1632    e. wcel 1696   {csn 3653   <.cop 3656   U.cuni 3843   `'ccnv 4704   Rel wrel 4710   ` cfv 5271   1stc1st 6136   2ndc2nd 6137
This theorem is referenced by:  cnvf1o  6233
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-iota 5235  df-fun 5273  df-fv 5279  df-1st 6138  df-2nd 6139
  Copyright terms: Public domain W3C validator