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

Theorem 2oconcl 6706
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 3794 . . . . 5  |-  ( A  e.  { (/) ,  1o }  ->  ( A  =  (/)  \/  A  =  1o ) )
2 difeq2 3419 . . . . . . . 8  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  ( 1o  \  (/) ) )
3 dif0 3658 . . . . . . . 8  |-  ( 1o 
\  (/) )  =  1o
42, 3syl6eq 2452 . . . . . . 7  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  1o )
5 difeq2 3419 . . . . . . . 8  |-  ( A  =  1o  ->  ( 1o  \  A )  =  ( 1o  \  1o ) )
6 difid 3656 . . . . . . . 8  |-  ( 1o 
\  1o )  =  (/)
75, 6syl6eq 2452 . . . . . . 7  |-  ( A  =  1o  ->  ( 1o  \  A )  =  (/) )
84, 7orim12i 503 . . . . . 6  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  1o  \/  ( 1o  \  A )  =  (/) ) )
98orcomd 378 . . . . 5  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  (/)  \/  ( 1o  \  A )  =  1o ) )
101, 9syl 16 . . . 4  |-  ( A  e.  { (/) ,  1o }  ->  ( ( 1o 
\  A )  =  (/)  \/  ( 1o  \  A )  =  1o ) )
11 1on 6690 . . . . . 6  |-  1o  e.  On
12 difexg 4311 . . . . . 6  |-  ( 1o  e.  On  ->  ( 1o  \  A )  e. 
_V )
1311, 12ax-mp 8 . . . . 5  |-  ( 1o 
\  A )  e. 
_V
1413elpr 3792 . . . 4  |-  ( ( 1o  \  A )  e.  { (/) ,  1o } 
<->  ( ( 1o  \  A )  =  (/)  \/  ( 1o  \  A
)  =  1o ) )
1510, 14sylibr 204 . . 3  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  { (/)
,  1o } )
16 df2o3 6696 . . 3  |-  2o  =  { (/) ,  1o }
1715, 16syl6eleqr 2495 . 2  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  2o )
1817, 16eleq2s 2496 1  |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 358    = wceq 1649    e. wcel 1721   _Vcvv 2916    \ cdif 3277   (/)c0 3588   {cpr 3775   Oncon0 4541   1oc1o 6676   2oc2o 6677
This theorem is referenced by:  efgmf  15300  efgmnvl  15301  efglem  15303  frgpuplem  15359
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-sep 4290  ax-nul 4298  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-sbc 3122  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-pss 3296  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-tp 3782  df-op 3783  df-uni 3976  df-br 4173  df-opab 4227  df-tr 4263  df-eprel 4454  df-po 4463  df-so 4464  df-fr 4501  df-we 4503  df-ord 4544  df-on 4545  df-suc 4547  df-1o 6683  df-2o 6684
  Copyright terms: Public domain W3C validator