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

Theorem onsucsssucexmid 4559
Description: The converse of onsucsssucr 4541 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 3264 . . . . . 6  |-  { z  e.  { (/) }  |  ph }  C_  { (/) }
2 ordtriexmidlem 4551 . . . . . . 7  |-  { z  e.  { (/) }  |  ph }  e.  On
3 sseq1 3202 . . . . . . . . 9  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  ( x  C_  {
(/) }  <->  { z  e.  { (/)
}  |  ph }  C_ 
{ (/) } ) )
4 suceq 4433 . . . . . . . . . 10  |-  ( x  =  { z  e. 
{ (/) }  |  ph }  ->  suc  x  =  suc  { z  e.  { (/)
}  |  ph }
)
54sseq1d 3208 . . . . . . . . 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 4442 . . . . . . . . . 10  |-  suc  (/)  =  { (/)
}
8 0elon 4423 . . . . . . . . . . 11  |-  (/)  e.  On
98onsuci 4548 . . . . . . . . . 10  |-  suc  (/)  e.  On
107, 9eqeltrri 2267 . . . . . . . . 9  |-  { (/) }  e.  On
11 p0ex 4217 . . . . . . . . . 10  |-  { (/) }  e.  _V
12 eleq1 2256 . . . . . . . . . . . 12  |-  ( y  =  { (/) }  ->  ( y  e.  On  <->  { (/) }  e.  On ) )
1312anbi2d 464 . . . . . . . . . . 11  |-  ( y  =  { (/) }  ->  ( ( x  e.  On  /\  y  e.  On )  <-> 
( x  e.  On  /\ 
{ (/) }  e.  On ) ) )
14 sseq2 3203 . . . . . . . . . . . 12  |-  ( y  =  { (/) }  ->  ( x  C_  y  <->  x  C_  { (/) } ) )
15 suceq 4433 . . . . . . . . . . . . 13  |-  ( y  =  { (/) }  ->  suc  y  =  suc  { (/)
} )
1615sseq2d 3209 . . . . . . . . . . . 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 2583 . . . . . . . . . 10  |-  ( ( x  e.  On  /\  y  e.  On )  ->  ( x  C_  y  ->  suc  x  C_  suc  y ) )
2111, 18, 20vtocl 2814 . . . . . . . . 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 2826 . . . . . . 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 4548 . . . . . . 7  |-  suc  { (/)
}  e.  On
2726onordi 4457 . . . . . 6  |-  Ord  suc  {
(/) }
28 ordelsuc 4537 . . . . . 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 4435 . . . . 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 3636 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  e.  {
(/) }  ->  { z  e.  { (/) }  |  ph }  =  (/) )
35 ordtriexmidlem2 4552 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  =  (/) 
->  -.  ph )
3634, 35syl 14 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  e.  {
(/) }  ->  -.  ph )
37 0ex 4156 . . . . 5  |-  (/)  e.  _V
38 biidd 172 . . . . 5  |-  ( z  =  (/)  ->  ( ph  <->  ph ) )
3937, 38rabsnt 3693 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  =  { (/) }  ->  ph )
4036, 39orim12i 760 . . 3  |-  ( ( { z  e.  { (/)
}  |  ph }  e.  { (/) }  \/  {
z  e.  { (/) }  |  ph }  =  { (/) } )  -> 
( -.  ph  \/  ph ) )
4133, 40ax-mp 5 . 2  |-  ( -. 
ph  \/  ph )
42 orcom 729 . 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 709    = wceq 1364    e. wcel 2164   A.wral 2472   {crab 2476    C_ wss 3153   (/)c0 3446   {csn 3618   Ord word 4393   Oncon0 4394   suc csuc 4396
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-uni 3836  df-tr 4128  df-iord 4397  df-on 4399  df-suc 4402
This theorem is referenced by:  oawordriexmid  6523
  Copyright terms: Public domain W3C validator