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

Theorem ordtriexmid 4518
Description: Ordinal trichotomy implies the law of the excluded middle (that is, decidability of an arbitrary proposition).

This theorem is stated in "Constructive ordinals", [Crosilla], p. "Set-theoretic principles incompatible with intuitionistic logic".

Also see exmidontri 7233 which is much the same theorem but biconditionalized and using the EXMID notation. (Contributed by Mario Carneiro and Jim Kingdon, 14-Nov-2018.)

Hypothesis
Ref Expression
ordtriexmid.1  |-  A. x  e.  On  A. y  e.  On  ( x  e.  y  \/  x  =  y  \/  y  e.  x )
Assertion
Ref Expression
ordtriexmid  |-  ( ph  \/  -.  ph )
Distinct variable groups:    x, y    ph, x
Allowed substitution hint:    ph( y)

Proof of Theorem ordtriexmid
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 noel 3426 . . . 4  |-  -.  {
z  e.  { (/) }  |  ph }  e.  (/)
2 ordtriexmidlem 4516 . . . . . 6  |-  { z  e.  { (/) }  |  ph }  e.  On
3 eleq1 2240 . . . . . . . 8  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( x  e.  (/) 
<->  { z  e.  { (/)
}  |  ph }  e.  (/) ) )
4 eqeq1 2184 . . . . . . . 8  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( x  =  (/) 
<->  { z  e.  { (/)
}  |  ph }  =  (/) ) )
5 eleq2 2241 . . . . . . . 8  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( (/)  e.  x  <->  (/)  e.  { z  e.  { (/)
}  |  ph }
) )
63, 4, 53orbi123d 1311 . . . . . . 7  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( ( x  e.  (/)  \/  x  =  (/)  \/  (/)  e.  x )  <-> 
( { z  e. 
{ (/) }  |  ph }  e.  (/)  \/  {
z  e.  { (/) }  |  ph }  =  (/) 
\/  (/)  e.  { z  e.  { (/) }  |  ph } ) ) )
7 0elon 4390 . . . . . . . 8  |-  (/)  e.  On
8 0ex 4128 . . . . . . . . 9  |-  (/)  e.  _V
9 eleq1 2240 . . . . . . . . . . 11  |-  ( y  =  (/)  ->  ( y  e.  On  <->  (/)  e.  On ) )
109anbi2d 464 . . . . . . . . . 10  |-  ( y  =  (/)  ->  ( ( x  e.  On  /\  y  e.  On )  <->  ( x  e.  On  /\  (/) 
e.  On ) ) )
11 eleq2 2241 . . . . . . . . . . 11  |-  ( y  =  (/)  ->  ( x  e.  y  <->  x  e.  (/) ) )
12 eqeq2 2187 . . . . . . . . . . 11  |-  ( y  =  (/)  ->  ( x  =  y  <->  x  =  (/) ) )
13 eleq1 2240 . . . . . . . . . . 11  |-  ( y  =  (/)  ->  ( y  e.  x  <->  (/)  e.  x
) )
1411, 12, 133orbi123d 1311 . . . . . . . . . 10  |-  ( y  =  (/)  ->  ( ( x  e.  y  \/  x  =  y  \/  y  e.  x )  <-> 
( x  e.  (/)  \/  x  =  (/)  \/  (/)  e.  x
) ) )
1510, 14imbi12d 234 . . . . . . . . 9  |-  ( y  =  (/)  ->  ( ( ( x  e.  On  /\  y  e.  On )  ->  ( x  e.  y  \/  x  =  y  \/  y  e.  x ) )  <->  ( (
x  e.  On  /\  (/) 
e.  On )  -> 
( x  e.  (/)  \/  x  =  (/)  \/  (/)  e.  x
) ) ) )
16 ordtriexmid.1 . . . . . . . . . 10  |-  A. x  e.  On  A. y  e.  On  ( x  e.  y  \/  x  =  y  \/  y  e.  x )
1716rspec2 2566 . . . . . . . . 9  |-  ( ( x  e.  On  /\  y  e.  On )  ->  ( x  e.  y  \/  x  =  y  \/  y  e.  x
) )
188, 15, 17vtocl 2791 . . . . . . . 8  |-  ( ( x  e.  On  /\  (/) 
e.  On )  -> 
( x  e.  (/)  \/  x  =  (/)  \/  (/)  e.  x
) )
197, 18mpan2 425 . . . . . . 7  |-  ( x  e.  On  ->  (
x  e.  (/)  \/  x  =  (/)  \/  (/)  e.  x
) )
206, 19vtoclga 2803 . . . . . 6  |-  ( { z  e.  { (/) }  |  ph }  e.  On  ->  ( { z  e.  { (/) }  |  ph }  e.  (/)  \/  {
z  e.  { (/) }  |  ph }  =  (/) 
\/  (/)  e.  { z  e.  { (/) }  |  ph } ) )
212, 20ax-mp 5 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  e.  (/) 
\/  { z  e. 
{ (/) }  |  ph }  =  (/)  \/  (/)  e.  {
z  e.  { (/) }  |  ph } )
22 3orass 981 . . . . 5  |-  ( ( { z  e.  { (/)
}  |  ph }  e.  (/)  \/  { z  e.  { (/) }  |  ph }  =  (/)  \/  (/)  e.  {
z  e.  { (/) }  |  ph } )  <-> 
( { z  e. 
{ (/) }  |  ph }  e.  (/)  \/  ( { z  e.  { (/)
}  |  ph }  =  (/)  \/  (/)  e.  {
z  e.  { (/) }  |  ph } ) ) )
2321, 22mpbi 145 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  e.  (/) 
\/  ( { z  e.  { (/) }  |  ph }  =  (/)  \/  (/)  e.  {
z  e.  { (/) }  |  ph } ) )
241, 23mtpor 1425 . . 3  |-  ( { z  e.  { (/) }  |  ph }  =  (/) 
\/  (/)  e.  { z  e.  { (/) }  |  ph } )
25 ordtriexmidlem2 4517 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  =  (/) 
->  -.  ph )
268snid 3623 . . . . . 6  |-  (/)  e.  { (/)
}
27 biidd 172 . . . . . . 7  |-  ( z  =  (/)  ->  ( ph  <->  ph ) )
2827elrab3 2894 . . . . . 6  |-  ( (/)  e.  { (/) }  ->  ( (/) 
e.  { z  e. 
{ (/) }  |  ph } 
<-> 
ph ) )
2926, 28ax-mp 5 . . . . 5  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  <->  ph )
3029biimpi 120 . . . 4  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  ->  ph )
3125, 30orim12i 759 . . 3  |-  ( ( { z  e.  { (/)
}  |  ph }  =  (/)  \/  (/)  e.  {
z  e.  { (/) }  |  ph } )  ->  ( -.  ph  \/  ph ) )
3224, 31ax-mp 5 . 2  |-  ( -. 
ph  \/  ph )
33 orcom 728 . 2  |-  ( (
ph  \/  -.  ph )  <->  ( -.  ph  \/  ph )
)
3432, 33mpbir 146 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    \/ w3o 977    = wceq 1353    e. wcel 2148   A.wral 2455   {crab 2459   (/)c0 3422   {csn 3592   Oncon0 4361
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-nul 4127  ax-pow 4172
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-uni 3809  df-tr 4100  df-iord 4364  df-on 4366  df-suc 4369
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator