ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  2oconcl Unicode version

Theorem 2oconcl 6712
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 3732 . . . . 5  |-  ( A  e.  { (/) ,  1o }  ->  ( A  =  (/)  \/  A  =  1o ) )
2 difeq2 3341 . . . . . . . 8  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  ( 1o  \  (/) ) )
3 dif0 3596 . . . . . . . 8  |-  ( 1o 
\  (/) )  =  1o
42, 3eqtrdi 2287 . . . . . . 7  |-  ( A  =  (/)  ->  ( 1o 
\  A )  =  1o )
5 difeq2 3341 . . . . . . . 8  |-  ( A  =  1o  ->  ( 1o  \  A )  =  ( 1o  \  1o ) )
6 difid 3594 . . . . . . . 8  |-  ( 1o 
\  1o )  =  (/)
75, 6eqtrdi 2287 . . . . . . 7  |-  ( A  =  1o  ->  ( 1o  \  A )  =  (/) )
84, 7orim12i 771 . . . . . 6  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  1o  \/  ( 1o  \  A )  =  (/) ) )
98orcomd 741 . . . . 5  |-  ( ( A  =  (/)  \/  A  =  1o )  ->  (
( 1o  \  A
)  =  (/)  \/  ( 1o  \  A )  =  1o ) )
101, 9syl 14 . . . 4  |-  ( A  e.  { (/) ,  1o }  ->  ( ( 1o 
\  A )  =  (/)  \/  ( 1o  \  A )  =  1o ) )
11 1on 6694 . . . . . 6  |-  1o  e.  On
12 difexg 4275 . . . . . 6  |-  ( 1o  e.  On  ->  ( 1o  \  A )  e. 
_V )
1311, 12ax-mp 5 . . . . 5  |-  ( 1o 
\  A )  e. 
_V
1413elpr 3730 . . . 4  |-  ( ( 1o  \  A )  e.  { (/) ,  1o } 
<->  ( ( 1o  \  A )  =  (/)  \/  ( 1o  \  A
)  =  1o ) )
1510, 14sylibr 134 . . 3  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  { (/)
,  1o } )
16 df2o3 6702 . . 3  |-  2o  =  { (/) ,  1o }
1715, 16eleqtrrdi 2332 . 2  |-  ( A  e.  { (/) ,  1o }  ->  ( 1o  \  A )  e.  2o )
1817, 16eleq2s 2333 1  |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    \/ wo 720    = wceq 1402    e. wcel 2209   _Vcvv 2821    \ cdif 3217   (/)c0 3520   {cpr 3710   Oncon0 4508   1oc1o 6680   2oc2o 6681
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-uni 3936  df-tr 4230  df-iord 4511  df-on 4513  df-suc 4516  df-1o 6687  df-2o 6688
This theorem is used by:  ismkvnex  7495
  Copyright terms: Public domain W3C validator