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

Theorem 2oconcl 7171
Description: Closure of the pair swapping function on  2o. (Contributed by Mario Carneiro, 27-Sep-2015.)
Assertion
Ref Expression
2oconcl  |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )

Proof of Theorem 2oconcl
StepHypRef Expression
1 elpri 4052 . . . . 5  |-  ( A  e.  { (/) ,  1o }  ->  ( A  =  (/)  \/  A  =  1o ) )
2 difeq2 3612 . . . . . . . 8  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  ( 1o  \  (/) ) )
3 dif0 3901 . . . . . . . 8  |-  ( 1o 
\  (/) )  =  1o
42, 3syl6eq 2514 . . . . . . 7  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  1o )
5 difeq2 3612 . . . . . . . 8  |-  ( A  =  1o  ->  ( 1o  \  A )  =  ( 1o  \  1o ) )
6 difid 3899 . . . . . . . 8  |-  ( 1o 
\  1o )  =  (/)
75, 6syl6eq 2514 . . . . . . 7  |-  ( A  =  1o  ->  ( 1o  \  A )  =  (/) )
84, 7orim12i 516 . . . . . 6  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  1o  \/  ( 1o  \  A )  =  (/) ) )
98orcomd 388 . . . . 5  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  (/)  \/  ( 1o  \  A )  =  1o ) )
101, 9syl 16 . . . 4  |-  ( A  e.  { (/) ,  1o }  ->  ( ( 1o 
\  A )  =  (/)  \/  ( 1o  \  A )  =  1o ) )
11 1on 7155 . . . . . 6  |-  1o  e.  On
12 difexg 4604 . . . . . 6  |-  ( 1o  e.  On  ->  ( 1o  \  A )  e. 
_V )
1311, 12ax-mp 5 . . . . 5  |-  ( 1o 
\  A )  e. 
_V
1413elpr 4050 . . . 4  |-  ( ( 1o  \  A )  e.  { (/) ,  1o } 
<->  ( ( 1o  \  A )  =  (/)  \/  ( 1o  \  A
)  =  1o ) )
1510, 14sylibr 212 . . 3  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  { (/)
,  1o } )
16 df2o3 7161 . . 3  |-  2o  =  { (/) ,  1o }
1715, 16syl6eleqr 2556 . 2  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  2o )
1817, 16eleq2s 2565 1  |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 368    = wceq 1395    e. wcel 1819   _Vcvv 3109    \ cdif 3468   (/)c0 3793   {cpr 4034   Oncon0 4887   1oc1o 7141   2oc2o 7142
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pr 4695  ax-un 6591
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4252  df-br 4457  df-opab 4516  df-tr 4551  df-eprel 4800  df-po 4809  df-so 4810  df-fr 4847  df-we 4849  df-ord 4890  df-on 4891  df-suc 4893  df-1o 7148  df-2o 7149
This theorem is referenced by:  efgmf  16857  efgmnvl  16858  efglem  16860  frgpuplem  16916
  Copyright terms: Public domain W3C validator