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

Theorem 0elsucexmid 4601
Description: If the successor of any ordinal class contains the empty set, excluded middle follows. (Contributed by Jim Kingdon, 3-Sep-2021.)
Hypothesis
Ref Expression
0elsucexmid.1  |-  A. x  e.  On  (/)  e.  suc  x
Assertion
Ref Expression
0elsucexmid  |-  ( ph  \/  -.  ph )
Distinct variable group:    ph, x

Proof of Theorem 0elsucexmid
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ordtriexmidlem 4555 . . . 4  |-  { y  e.  { (/) }  |  ph }  e.  On
2 0elsucexmid.1 . . . 4  |-  A. x  e.  On  (/)  e.  suc  x
3 suceq 4437 . . . . . 6  |-  ( x  =  { y  e. 
{ (/) }  |  ph }  ->  suc  x  =  suc  { y  e.  { (/)
}  |  ph }
)
43eleq2d 2266 . . . . 5  |-  ( x  =  { y  e. 
{ (/) }  |  ph }  ->  ( (/)  e.  suc  x 
<->  (/)  e.  suc  { y  e.  { (/) }  |  ph } ) )
54rspcv 2864 . . . 4  |-  ( { y  e.  { (/) }  |  ph }  e.  On  ->  ( A. x  e.  On  (/)  e.  suc  x  -> 
(/)  e.  suc  { y  e.  { (/) }  |  ph } ) )
61, 2, 5mp2 16 . . 3  |-  (/)  e.  suc  { y  e.  { (/) }  |  ph }
7 0ex 4160 . . . 4  |-  (/)  e.  _V
87elsuc 4441 . . 3  |-  ( (/)  e.  suc  { y  e. 
{ (/) }  |  ph } 
<->  ( (/)  e.  { y  e.  { (/) }  |  ph }  \/  (/)  =  {
y  e.  { (/) }  |  ph } ) )
96, 8mpbi 145 . 2  |-  ( (/)  e.  { y  e.  { (/)
}  |  ph }  \/  (/)  =  { y  e.  { (/) }  |  ph } )
107snid 3653 . . . . 5  |-  (/)  e.  { (/)
}
11 biidd 172 . . . . . 6  |-  ( y  =  (/)  ->  ( ph  <->  ph ) )
1211elrab3 2921 . . . . 5  |-  ( (/)  e.  { (/) }  ->  ( (/) 
e.  { y  e. 
{ (/) }  |  ph } 
<-> 
ph ) )
1310, 12ax-mp 5 . . . 4  |-  ( (/)  e.  { y  e.  { (/)
}  |  ph }  <->  ph )
1413biimpi 120 . . 3  |-  ( (/)  e.  { y  e.  { (/)
}  |  ph }  ->  ph )
15 ordtriexmidlem2 4556 . . . 4  |-  ( { y  e.  { (/) }  |  ph }  =  (/) 
->  -.  ph )
1615eqcoms 2199 . . 3  |-  ( (/)  =  { y  e.  { (/)
}  |  ph }  ->  -.  ph )
1714, 16orim12i 760 . 2  |-  ( (
(/)  e.  { y  e.  { (/) }  |  ph }  \/  (/)  =  {
y  e.  { (/) }  |  ph } )  ->  ( ph  \/  -.  ph ) )
189, 17ax-mp 5 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 105    \/ wo 709    = wceq 1364    e. wcel 2167   A.wral 2475   {crab 2479   (/)c0 3450   {csn 3622   Oncon0 4398   suc csuc 4400
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-nul 4159  ax-pow 4207
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-uni 3840  df-tr 4132  df-iord 4401  df-on 4403  df-suc 4406
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator