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

Theorem reg2exmid 4537
Description: If any inhabited set has a minimal element (when expressed by  C_), excluded middle follows. (Contributed by Jim Kingdon, 2-Oct-2021.)
Hypothesis
Ref Expression
reg2exmid.1  |-  A. z
( E. w  w  e.  z  ->  E. x  e.  z  A. y  e.  z  x  C_  y
)
Assertion
Ref Expression
reg2exmid  |-  ( ph  \/  -.  ph )
Distinct variable groups:    ph, w, z    ph, x, z, y

Proof of Theorem reg2exmid
Dummy variable  u is distinct from all other variables.
StepHypRef Expression
1 eqid 2177 . . . 4  |-  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  =  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) }
21regexmidlemm 4533 . . 3  |-  E. w  w  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }
3 reg2exmid.1 . . . 4  |-  A. z
( E. w  w  e.  z  ->  E. x  e.  z  A. y  e.  z  x  C_  y
)
4 pp0ex 4191 . . . . . 6  |-  { (/) ,  { (/) } }  e.  _V
54rabex 4149 . . . . 5  |-  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  e.  _V
6 eleq2 2241 . . . . . . 7  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( w  e.  z  <->  w  e.  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) } ) )
76exbidv 1825 . . . . . 6  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( E. w  w  e.  z  <->  E. w  w  e. 
{ u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } ) )
8 raleq 2673 . . . . . . 7  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( A. y  e.  z  x  C_  y  <->  A. y  e.  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } x  C_  y ) )
98rexeqbi1dv 2682 . . . . . 6  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( E. x  e.  z 
A. y  e.  z  x  C_  y  <->  E. x  e.  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y ) )
107, 9imbi12d 234 . . . . 5  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( ( E. w  w  e.  z  ->  E. x  e.  z  A. y  e.  z  x  C_  y
)  <->  ( E. w  w  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  E. x  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y ) ) )
115, 10spcv 2833 . . . 4  |-  ( A. z ( E. w  w  e.  z  ->  E. x  e.  z  A. y  e.  z  x  C_  y )  ->  ( E. w  w  e.  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) }  ->  E. x  e.  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y ) )
123, 11ax-mp 5 . . 3  |-  ( E. w  w  e.  {
u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) }  ->  E. x  e.  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y )
132, 12ax-mp 5 . 2  |-  E. x  e.  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y
141reg2exmidlema 4535 . 2  |-  ( E. x  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y  ->  ( ph  \/  -.  ph ) )
1513, 14ax-mp 5 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 708   A.wal 1351    = wceq 1353   E.wex 1492    e. wcel 2148   A.wral 2455   E.wrex 2456   {crab 2459    C_ wss 3131   (/)c0 3424   {csn 3594   {cpr 3595
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 4123  ax-nul 4131  ax-pow 4176
This theorem depends on definitions:  df-bi 117  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
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator