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

Theorem exmid01 4116
Description: Excluded middle is equivalent to saying any subset of  { (/) } is either  (/) or  { (/) }. (Contributed by BJ and Jim Kingdon, 18-Jun-2022.)
Assertion
Ref Expression
exmid01  |-  (EXMID  <->  A. x
( x  C_  { (/) }  ->  ( x  =  (/)  \/  x  =  { (/)
} ) ) )

Proof of Theorem exmid01
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-exmid 4114 . 2  |-  (EXMID  <->  A. x
( x  C_  { (/) }  -> DECID  (/) 
e.  x ) )
2 df-dc 820 . . . . 5  |-  (DECID  (/)  e.  x  <->  (
(/)  e.  x  \/  -.  (/)  e.  x ) )
3 orcom 717 . . . . . 6  |-  ( (
(/)  e.  x  \/  -.  (/)  e.  x )  <-> 
( -.  (/)  e.  x  \/  (/)  e.  x ) )
4 simpll 518 . . . . . . . . . . . . . 14  |-  ( ( ( x  C_  { (/) }  /\  -.  (/)  e.  x
)  /\  y  e.  x )  ->  x  C_ 
{ (/) } )
5 simpr 109 . . . . . . . . . . . . . 14  |-  ( ( ( x  C_  { (/) }  /\  -.  (/)  e.  x
)  /\  y  e.  x )  ->  y  e.  x )
64, 5sseldd 3093 . . . . . . . . . . . . 13  |-  ( ( ( x  C_  { (/) }  /\  -.  (/)  e.  x
)  /\  y  e.  x )  ->  y  e.  { (/) } )
7 velsn 3539 . . . . . . . . . . . . 13  |-  ( y  e.  { (/) }  <->  y  =  (/) )
86, 7sylib 121 . . . . . . . . . . . 12  |-  ( ( ( x  C_  { (/) }  /\  -.  (/)  e.  x
)  /\  y  e.  x )  ->  y  =  (/) )
98, 5eqeltrrd 2215 . . . . . . . . . . 11  |-  ( ( ( x  C_  { (/) }  /\  -.  (/)  e.  x
)  /\  y  e.  x )  ->  (/)  e.  x
)
10 simplr 519 . . . . . . . . . . 11  |-  ( ( ( x  C_  { (/) }  /\  -.  (/)  e.  x
)  /\  y  e.  x )  ->  -.  (/) 
e.  x )
119, 10pm2.65da 650 . . . . . . . . . 10  |-  ( ( x  C_  { (/) }  /\  -.  (/)  e.  x )  ->  -.  y  e.  x )
1211eq0rdv 3402 . . . . . . . . 9  |-  ( ( x  C_  { (/) }  /\  -.  (/)  e.  x )  ->  x  =  (/) )
1312ex 114 . . . . . . . 8  |-  ( x 
C_  { (/) }  ->  ( -.  (/)  e.  x  ->  x  =  (/) ) )
14 noel 3362 . . . . . . . . 9  |-  -.  (/)  e.  (/)
15 eleq2 2201 . . . . . . . . 9  |-  ( x  =  (/)  ->  ( (/)  e.  x  <->  (/)  e.  (/) ) )
1614, 15mtbiri 664 . . . . . . . 8  |-  ( x  =  (/)  ->  -.  (/)  e.  x
)
1713, 16impbid1 141 . . . . . . 7  |-  ( x 
C_  { (/) }  ->  ( -.  (/)  e.  x  <->  x  =  (/) ) )
18 elex2 2697 . . . . . . . . . 10  |-  ( (/)  e.  x  ->  E. z 
z  e.  x )
19 sssnm 3676 . . . . . . . . . 10  |-  ( E. z  z  e.  x  ->  ( x  C_  { (/) }  <-> 
x  =  { (/) } ) )
2018, 19syl 14 . . . . . . . . 9  |-  ( (/)  e.  x  ->  ( x 
C_  { (/) }  <->  x  =  { (/) } ) )
2120biimpcd 158 . . . . . . . 8  |-  ( x 
C_  { (/) }  ->  (
(/)  e.  x  ->  x  =  { (/) } ) )
22 0ex 4050 . . . . . . . . . 10  |-  (/)  e.  _V
2322snid 3551 . . . . . . . . 9  |-  (/)  e.  { (/)
}
24 eleq2 2201 . . . . . . . . 9  |-  ( x  =  { (/) }  ->  (
(/)  e.  x  <->  (/)  e.  { (/)
} ) )
2523, 24mpbiri 167 . . . . . . . 8  |-  ( x  =  { (/) }  ->  (/)  e.  x )
2621, 25impbid1 141 . . . . . . 7  |-  ( x 
C_  { (/) }  ->  (
(/)  e.  x  <->  x  =  { (/) } ) )
2717, 26orbi12d 782 . . . . . 6  |-  ( x 
C_  { (/) }  ->  ( ( -.  (/)  e.  x  \/  (/)  e.  x )  <-> 
( x  =  (/)  \/  x  =  { (/) } ) ) )
283, 27syl5bb 191 . . . . 5  |-  ( x 
C_  { (/) }  ->  ( ( (/)  e.  x  \/  -.  (/)  e.  x )  <-> 
( x  =  (/)  \/  x  =  { (/) } ) ) )
292, 28syl5bb 191 . . . 4  |-  ( x 
C_  { (/) }  ->  (DECID  (/)  e.  x  <->  ( x  =  (/)  \/  x  =  { (/)
} ) ) )
3029pm5.74i 179 . . 3  |-  ( ( x  C_  { (/) }  -> DECID  (/)  e.  x
)  <->  ( x  C_  {
(/) }  ->  ( x  =  (/)  \/  x  =  { (/) } ) ) )
3130albii 1446 . 2  |-  ( A. x ( x  C_  {
(/) }  -> DECID  (/)  e.  x )  <->  A. x ( x  C_  {
(/) }  ->  ( x  =  (/)  \/  x  =  { (/) } ) ) )
321, 31bitri 183 1  |-  (EXMID  <->  A. x
( x  C_  { (/) }  ->  ( x  =  (/)  \/  x  =  { (/)
} ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 697  DECID wdc 819   A.wal 1329    = wceq 1331   E.wex 1468    e. wcel 1480    C_ wss 3066   (/)c0 3358   {csn 3522  EXMIDwem 4113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-nul 4049
This theorem depends on definitions:  df-bi 116  df-dc 820  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-dif 3068  df-in 3072  df-ss 3079  df-nul 3359  df-sn 3528  df-exmid 4114
This theorem is referenced by:  exmid1dc  4118  exmidn0m  4119  exmidsssn  4120  exmidpw  6795  exmidomni  7007  ss1oel2o  13178  exmidsbthrlem  13206  sbthom  13210
  Copyright terms: Public domain W3C validator