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

Theorem 0elsucexmid 4621
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 4575 . . . 4  |-  { y  e.  { (/) }  |  ph }  e.  On
2 0elsucexmid.1 . . . 4  |-  A. x  e.  On  (/)  e.  suc  x
3 suceq 4457 . . . . . 6  |-  ( x  =  { y  e. 
{ (/) }  |  ph }  ->  suc  x  =  suc  { y  e.  { (/)
}  |  ph }
)
43eleq2d 2276 . . . . 5  |-  ( x  =  { y  e. 
{ (/) }  |  ph }  ->  ( (/)  e.  suc  x 
<->  (/)  e.  suc  { y  e.  { (/) }  |  ph } ) )
54rspcv 2877 . . . 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 4179 . . . 4  |-  (/)  e.  _V
87elsuc 4461 . . 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 3669 . . . . 5  |-  (/)  e.  { (/)
}
11 biidd 172 . . . . . 6  |-  ( y  =  (/)  ->  ( ph  <->  ph ) )
1211elrab3 2934 . . . . 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 4576 . . . 4  |-  ( { y  e.  { (/) }  |  ph }  =  (/) 
->  -.  ph )
1615eqcoms 2209 . . 3  |-  ( (/)  =  { y  e.  { (/)
}  |  ph }  ->  -.  ph )
1714, 16orim12i 761 . 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 710    = wceq 1373    e. wcel 2177   A.wral 2485   {crab 2489   (/)c0 3464   {csn 3638   Oncon0 4418   suc csuc 4420
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-nul 4178  ax-pow 4226
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-uni 3857  df-tr 4151  df-iord 4421  df-on 4423  df-suc 4426
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator