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

Theorem 2oconcl 7145
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 4042 . . . . 5  |-  ( A  e.  { (/) ,  1o }  ->  ( A  =  (/)  \/  A  =  1o ) )
2 difeq2 3611 . . . . . . . 8  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  ( 1o  \  (/) ) )
3 dif0 3892 . . . . . . . 8  |-  ( 1o 
\  (/) )  =  1o
42, 3syl6eq 2519 . . . . . . 7  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  1o )
5 difeq2 3611 . . . . . . . 8  |-  ( A  =  1o  ->  ( 1o  \  A )  =  ( 1o  \  1o ) )
6 difid 3890 . . . . . . . 8  |-  ( 1o 
\  1o )  =  (/)
75, 6syl6eq 2519 . . . . . . 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 7129 . . . . . 6  |-  1o  e.  On
12 difexg 4590 . . . . . 6  |-  ( 1o  e.  On  ->  ( 1o  \  A )  e. 
_V )
1311, 12ax-mp 5 . . . . 5  |-  ( 1o 
\  A )  e. 
_V
1413elpr 4040 . . . 4  |-  ( ( 1o  \  A )  e.  { (/) ,  1o } 
<->  ( ( 1o  \  A )  =  (/)  \/  ( 1o  \  A
)  =  1o ) )
1510, 14sylibr 212 . . 3  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  { (/)
,  1o } )
16 df2o3 7135 . . 3  |-  2o  =  { (/) ,  1o }
1715, 16syl6eleqr 2561 . 2  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  2o )
1817, 16eleq2s 2570 1  |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 368    = wceq 1374    e. wcel 1762   _Vcvv 3108    \ cdif 3468   (/)c0 3780   {cpr 4024   Oncon0 4873   1oc1o 7115   2oc2o 7116
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1963  ax-ext 2440  ax-sep 4563  ax-nul 4571  ax-pr 4681  ax-un 6569
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 969  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2274  df-mo 2275  df-clab 2448  df-cleq 2454  df-clel 2457  df-nfc 2612  df-ne 2659  df-ral 2814  df-rex 2815  df-rab 2818  df-v 3110  df-sbc 3327  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3781  df-if 3935  df-pw 4007  df-sn 4023  df-pr 4025  df-tp 4027  df-op 4029  df-uni 4241  df-br 4443  df-opab 4501  df-tr 4536  df-eprel 4786  df-po 4795  df-so 4796  df-fr 4833  df-we 4835  df-ord 4876  df-on 4877  df-suc 4879  df-1o 7122  df-2o 7123
This theorem is referenced by:  efgmf  16522  efgmnvl  16523  efglem  16525  frgpuplem  16581
  Copyright terms: Public domain W3C validator