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

Theorem onsucsssucexmid 4528
Description: The converse of onsucsssucr 4510 implies excluded middle. (Contributed by Mario Carneiro and Jim Kingdon, 29-Jul-2019.)
Hypothesis
Ref Expression
onsucsssucexmid.1  |-  A. x  e.  On  A. y  e.  On  ( x  C_  y  ->  suc  x  C_  suc  y )
Assertion
Ref Expression
onsucsssucexmid  |-  ( ph  \/  -.  ph )
Distinct variable groups:    ph, x    x, y
Allowed substitution hint:    ph( y)

Proof of Theorem onsucsssucexmid
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 ssrab2 3242 . . . . . 6  |-  { z  e.  { (/) }  |  ph }  C_  { (/) }
2 ordtriexmidlem 4520 . . . . . . 7  |-  { z  e.  { (/) }  |  ph }  e.  On
3 sseq1 3180 . . . . . . . . 9  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( x  C_  {
(/) }  <->  { z  e.  { (/)
}  |  ph }  C_ 
{ (/) } ) )
4 suceq 4404 . . . . . . . . . 10  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  suc  x  =  suc  { z  e.  { (/)
}  |  ph }
)
54sseq1d 3186 . . . . . . . . 9  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( suc  x  C_ 
suc  { (/) }  <->  suc  { z  e.  { (/) }  |  ph }  C_  suc  { (/) } ) )
63, 5imbi12d 234 . . . . . . . 8  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( ( x 
C_  { (/) }  ->  suc  x  C_  suc  { (/) } )  <->  ( { z  e.  { (/) }  |  ph }  C_  { (/) }  ->  suc 
{ z  e.  { (/)
}  |  ph }  C_ 
suc  { (/) } ) ) )
7 suc0 4413 . . . . . . . . . 10  |-  suc  (/)  =  { (/)
}
8 0elon 4394 . . . . . . . . . . 11  |-  (/)  e.  On
98onsuci 4517 . . . . . . . . . 10  |-  suc  (/)  e.  On
107, 9eqeltrri 2251 . . . . . . . . 9  |-  { (/) }  e.  On
11 p0ex 4190 . . . . . . . . . 10  |-  { (/) }  e.  _V
12 eleq1 2240 . . . . . . . . . . . 12  |-  ( y  =  { (/) }  ->  ( y  e.  On  <->  { (/) }  e.  On ) )
1312anbi2d 464 . . . . . . . . . . 11  |-  ( y  =  { (/) }  ->  ( ( x  e.  On  /\  y  e.  On )  <-> 
( x  e.  On  /\ 
{ (/) }  e.  On ) ) )
14 sseq2 3181 . . . . . . . . . . . 12  |-  ( y  =  { (/) }  ->  ( x  C_  y  <->  x  C_  { (/) } ) )
15 suceq 4404 . . . . . . . . . . . . 13  |-  ( y  =  { (/) }  ->  suc  y  =  suc  { (/)
} )
1615sseq2d 3187 . . . . . . . . . . . 12  |-  ( y  =  { (/) }  ->  ( suc  x  C_  suc  y 
<->  suc  x  C_  suc  {
(/) } ) )
1714, 16imbi12d 234 . . . . . . . . . . 11  |-  ( y  =  { (/) }  ->  ( ( x  C_  y  ->  suc  x  C_  suc  y )  <->  ( x  C_ 
{ (/) }  ->  suc  x  C_  suc  { (/) } ) ) )
1813, 17imbi12d 234 . . . . . . . . . 10  |-  ( y  =  { (/) }  ->  ( ( ( x  e.  On  /\  y  e.  On )  ->  (
x  C_  y  ->  suc  x  C_  suc  y ) )  <->  ( ( x  e.  On  /\  { (/)
}  e.  On )  ->  ( x  C_  {
(/) }  ->  suc  x  C_ 
suc  { (/) } ) ) ) )
19 onsucsssucexmid.1 . . . . . . . . . . 11  |-  A. x  e.  On  A. y  e.  On  ( x  C_  y  ->  suc  x  C_  suc  y )
2019rspec2 2566 . . . . . . . . . 10  |-  ( ( x  e.  On  /\  y  e.  On )  ->  ( x  C_  y  ->  suc  x  C_  suc  y ) )
2111, 18, 20vtocl 2793 . . . . . . . . 9  |-  ( ( x  e.  On  /\  {
(/) }  e.  On )  ->  ( x  C_  {
(/) }  ->  suc  x  C_ 
suc  { (/) } ) )
2210, 21mpan2 425 . . . . . . . 8  |-  ( x  e.  On  ->  (
x  C_  { (/) }  ->  suc  x  C_  suc  { (/) } ) )
236, 22vtoclga 2805 . . . . . . 7  |-  ( { z  e.  { (/) }  |  ph }  e.  On  ->  ( { z  e.  { (/) }  |  ph }  C_  { (/) }  ->  suc 
{ z  e.  { (/)
}  |  ph }  C_ 
suc  { (/) } ) )
242, 23ax-mp 5 . . . . . 6  |-  ( { z  e.  { (/) }  |  ph }  C_  {
(/) }  ->  suc  {
z  e.  { (/) }  |  ph }  C_  suc  { (/) } )
251, 24ax-mp 5 . . . . 5  |-  suc  {
z  e.  { (/) }  |  ph }  C_  suc  { (/) }
2610onsuci 4517 . . . . . . 7  |-  suc  { (/)
}  e.  On
2726onordi 4428 . . . . . 6  |-  Ord  suc  {
(/) }
28 ordelsuc 4506 . . . . . 6  |-  ( ( { z  e.  { (/)
}  |  ph }  e.  On  /\  Ord  suc  {
(/) } )  ->  ( { z  e.  { (/)
}  |  ph }  e.  suc  { (/) }  <->  suc  { z  e.  { (/) }  |  ph }  C_  suc  { (/) } ) )
292, 27, 28mp2an 426 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  e.  suc  { (/) }  <->  suc  { z  e.  { (/) }  |  ph }  C_  suc  { (/) } )
3025, 29mpbir 146 . . . 4  |-  { z  e.  { (/) }  |  ph }  e.  suc  { (/)
}
31 elsucg 4406 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  e.  On  ->  ( { z  e.  { (/) }  |  ph }  e.  suc  { (/)
}  <->  ( { z  e.  { (/) }  |  ph }  e.  { (/) }  \/  { z  e. 
{ (/) }  |  ph }  =  { (/) } ) ) )
322, 31ax-mp 5 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  e.  suc  { (/) }  <->  ( {
z  e.  { (/) }  |  ph }  e.  {
(/) }  \/  { z  e.  { (/) }  |  ph }  =  { (/) } ) )
3330, 32mpbi 145 . . 3  |-  ( { z  e.  { (/) }  |  ph }  e.  {
(/) }  \/  { z  e.  { (/) }  |  ph }  =  { (/) } )
34 elsni 3612 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  e.  {
(/) }  ->  { z  e.  { (/) }  |  ph }  =  (/) )
35 ordtriexmidlem2 4521 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  =  (/) 
->  -.  ph )
3634, 35syl 14 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  e.  {
(/) }  ->  -.  ph )
37 0ex 4132 . . . . 5  |-  (/)  e.  _V
38 biidd 172 . . . . 5  |-  ( z  =  (/)  ->  ( ph  <->  ph ) )
3937, 38rabsnt 3669 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  =  { (/) }  ->  ph )
4036, 39orim12i 759 . . 3  |-  ( ( { z  e.  { (/)
}  |  ph }  e.  { (/) }  \/  {
z  e.  { (/) }  |  ph }  =  { (/) } )  -> 
( -.  ph  \/  ph ) )
4133, 40ax-mp 5 . 2  |-  ( -. 
ph  \/  ph )
42 orcom 728 . 2  |-  ( ( -.  ph  \/  ph )  <->  (
ph  \/  -.  ph )
)
4341, 42mpbi 145 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    = wceq 1353    e. wcel 2148   A.wral 2455   {crab 2459    C_ wss 3131   (/)c0 3424   {csn 3594   Ord word 4364   Oncon0 4365   suc csuc 4367
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-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435
This theorem depends on definitions:  df-bi 117  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 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-uni 3812  df-tr 4104  df-iord 4368  df-on 4370  df-suc 4373
This theorem is referenced by:  oawordriexmid  6473
  Copyright terms: Public domain W3C validator