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

Theorem 2oconcl 6518
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 3673 . . . . 5  |-  ( A  e.  { (/) ,  1o }  ->  ( A  =  (/)  \/  A  =  1o ) )
2 difeq2 3301 . . . . . . . 8  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  ( 1o  \  (/) ) )
3 dif0 3537 . . . . . . . 8  |-  ( 1o 
\  (/) )  =  1o
42, 3syl6eq 2344 . . . . . . 7  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  1o )
5 difeq2 3301 . . . . . . . 8  |-  ( A  =  1o  ->  ( 1o  \  A )  =  ( 1o  \  1o ) )
6 difid 3535 . . . . . . . 8  |-  ( 1o 
\  1o )  =  (/)
75, 6syl6eq 2344 . . . . . . 7  |-  ( A  =  1o  ->  ( 1o  \  A )  =  (/) )
84, 7orim12i 502 . . . . . 6  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  1o  \/  ( 1o  \  A )  =  (/) ) )
98orcomd 377 . . . . 5  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  (/)  \/  ( 1o  \  A )  =  1o ) )
101, 9syl 15 . . . 4  |-  ( A  e.  { (/) ,  1o }  ->  ( ( 1o 
\  A )  =  (/)  \/  ( 1o  \  A )  =  1o ) )
11 1on 6502 . . . . . 6  |-  1o  e.  On
12 difexg 4178 . . . . . 6  |-  ( 1o  e.  On  ->  ( 1o  \  A )  e. 
_V )
1311, 12ax-mp 8 . . . . 5  |-  ( 1o 
\  A )  e. 
_V
1413elpr 3671 . . . 4  |-  ( ( 1o  \  A )  e.  { (/) ,  1o } 
<->  ( ( 1o  \  A )  =  (/)  \/  ( 1o  \  A
)  =  1o ) )
1510, 14sylibr 203 . . 3  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  { (/)
,  1o } )
16 df2o3 6508 . . 3  |-  2o  =  { (/) ,  1o }
1715, 16syl6eleqr 2387 . 2  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  2o )
1817, 16eleq2s 2388 1  |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 357    = wceq 1632    e. wcel 1696   _Vcvv 2801    \ cdif 3162   (/)c0 3468   {cpr 3654   Oncon0 4408   1oc1o 6488   2oc2o 6489
This theorem is referenced by:  efgmf  15038  efgmnvl  15039  efglem  15041  frgpuplem  15097
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-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  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-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-tr 4130  df-eprel 4321  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-suc 4414  df-1o 6495  df-2o 6496
  Copyright terms: Public domain W3C validator