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

Theorem en2other2 8458
Description: Taking the other element twice in a pair gets back to the original element. (Contributed by Stefan O'Rear, 22-Aug-2015.)
Assertion
Ref Expression
en2other2  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  U. ( P  \  { U. ( P  \  { X } ) } )  =  X )

Proof of Theorem en2other2
StepHypRef Expression
1 en2eleq 8457 . . . . . . 7  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  P  =  { X ,  U. ( P  \  { X } ) } )
2 prcom 4041 . . . . . . 7  |-  { X ,  U. ( P  \  { X } ) }  =  { U. ( P  \  { X }
) ,  X }
31, 2syl6eq 2521 . . . . . 6  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  P  =  { U. ( P  \  { X }
) ,  X }
)
43difeq1d 3539 . . . . 5  |-  ( ( X  e.  P  /\  P  ~~  2o )  -> 
( P  \  { U. ( P  \  { X } ) } )  =  ( { U. ( P  \  { X } ) ,  X }  \  { U. ( P  \  { X }
) } ) )
5 difprsnss 4098 . . . . 5  |-  ( { U. ( P  \  { X } ) ,  X }  \  { U. ( P  \  { X } ) } ) 
C_  { X }
64, 5syl6eqss 3468 . . . 4  |-  ( ( X  e.  P  /\  P  ~~  2o )  -> 
( P  \  { U. ( P  \  { X } ) } ) 
C_  { X }
)
7 simpl 464 . . . . . 6  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  X  e.  P )
8 1onn 7358 . . . . . . . . . 10  |-  1o  e.  om
98a1i 11 . . . . . . . . 9  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  1o  e.  om )
10 simpr 468 . . . . . . . . . 10  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  P  ~~  2o )
11 df-2o 7201 . . . . . . . . . 10  |-  2o  =  suc  1o
1210, 11syl6breq 4435 . . . . . . . . 9  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  P  ~~  suc  1o )
13 dif1en 7822 . . . . . . . . 9  |-  ( ( 1o  e.  om  /\  P  ~~  suc  1o  /\  X  e.  P )  ->  ( P  \  { X } )  ~~  1o )
149, 12, 7, 13syl3anc 1292 . . . . . . . 8  |-  ( ( X  e.  P  /\  P  ~~  2o )  -> 
( P  \  { X } )  ~~  1o )
15 en1uniel 7659 . . . . . . . 8  |-  ( ( P  \  { X } )  ~~  1o  ->  U. ( P  \  { X } )  e.  ( P  \  { X } ) )
16 eldifsni 4089 . . . . . . . 8  |-  ( U. ( P  \  { X } )  e.  ( P  \  { X } )  ->  U. ( P  \  { X }
)  =/=  X )
1714, 15, 163syl 18 . . . . . . 7  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  U. ( P  \  { X } )  =/=  X
)
1817necomd 2698 . . . . . 6  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  X  =/=  U. ( P 
\  { X }
) )
19 eldifsn 4088 . . . . . 6  |-  ( X  e.  ( P  \  { U. ( P  \  { X } ) } )  <->  ( X  e.  P  /\  X  =/=  U. ( P  \  { X } ) ) )
207, 18, 19sylanbrc 677 . . . . 5  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  X  e.  ( P  \  { U. ( P 
\  { X }
) } ) )
2120snssd 4108 . . . 4  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  { X }  C_  ( P  \  { U. ( P  \  { X }
) } ) )
226, 21eqssd 3435 . . 3  |-  ( ( X  e.  P  /\  P  ~~  2o )  -> 
( P  \  { U. ( P  \  { X } ) } )  =  { X }
)
2322unieqd 4200 . 2  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  U. ( P  \  { U. ( P  \  { X } ) } )  =  U. { X } )
24 unisng 4206 . . 3  |-  ( X  e.  P  ->  U. { X }  =  X
)
2524adantr 472 . 2  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  U. { X }  =  X )
2623, 25eqtrd 2505 1  |-  ( ( X  e.  P  /\  P  ~~  2o )  ->  U. ( P  \  { U. ( P  \  { X } ) } )  =  X )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 376    = wceq 1452    e. wcel 1904    =/= wne 2641    \ cdif 3387   {csn 3959   {cpr 3961   U.cuni 4190   class class class wbr 4395   suc csuc 5432   omcom 6711   1oc1o 7193   2oc2o 7194    ~~ cen 7584
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602
This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3or 1008  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-ral 2761  df-rex 2762  df-reu 2763  df-rab 2765  df-v 3033  df-sbc 3256  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-pss 3406  df-nul 3723  df-if 3873  df-pw 3944  df-sn 3960  df-pr 3962  df-tp 3964  df-op 3966  df-uni 4191  df-br 4396  df-opab 4455  df-tr 4491  df-eprel 4750  df-id 4754  df-po 4760  df-so 4761  df-fr 4798  df-we 4800  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-ord 5433  df-on 5434  df-lim 5435  df-suc 5436  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-om 6712  df-1o 7200  df-2o 7201  df-er 7381  df-en 7588  df-dom 7589  df-sdom 7590  df-fin 7591
This theorem is referenced by:  pmtrfinv  17180
  Copyright terms: Public domain W3C validator