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

Theorem reg3exmid 4395
Description: If any inhabited set satisfying df-wetr 4161 for  _E has a minimal element, excluded middle follows. (Contributed by Jim Kingdon, 3-Oct-2021.)
Hypothesis
Ref Expression
reg3exmid.1  |-  ( (  _E  We  z  /\  E. w  w  e.  z )  ->  E. x  e.  z  A. y  e.  z  x  C_  y
)
Assertion
Ref Expression
reg3exmid  |-  ( ph  \/  -.  ph )
Distinct variable groups:    ph, w, z    ph, x, y, z

Proof of Theorem reg3exmid
Dummy variable  u is distinct from all other variables.
StepHypRef Expression
1 eqid 2088 . . 3  |-  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  =  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) }
21regexmidlemm 4348 . 2  |-  E. w  w  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }
31reg3exmidlemwe 4394 . . 3  |-  _E  We  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) }
4 pp0ex 4024 . . . . 5  |-  { (/) ,  { (/) } }  e.  _V
54rabex 3983 . . . 4  |-  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  e.  _V
6 weeq2 4184 . . . . . 6  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  (  _E  We  z  <->  _E  We  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) } ) )
7 eleq2 2151 . . . . . . 7  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( w  e.  z  <->  w  e.  { u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) } ) )
87exbidv 1753 . . . . . 6  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( E. w  w  e.  z  <->  E. w  w  e. 
{ u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } ) )
96, 8anbi12d 457 . . . . 5  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( (  _E  We  z  /\  E. w  w  e.  z )  <->  (  _E  We  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) }  /\  E. w  w  e.  {
u  e.  { (/) ,  { (/) } }  | 
( u  =  { (/)
}  \/  ( u  =  (/)  /\  ph )
) } ) ) )
10 raleq 2562 . . . . . 6  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( A. y  e.  z  x  C_  y  <->  A. y  e.  { u  e.  { (/)
,  { (/) } }  |  ( u  =  { (/) }  \/  (
u  =  (/)  /\  ph ) ) } x  C_  y ) )
1110rexeqbi1dv 2571 . . . . 5  |-  ( 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 ) )
129, 11imbi12d 232 . . . 4  |-  ( z  =  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  ->  ( ( (  _E  We  z  /\  E. w  w  e.  z )  ->  E. x  e.  z  A. y  e.  z  x  C_  y )  <->  ( (  _E  We  { u  e. 
{ (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  /\  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 ) ) )
13 reg3exmid.1 . . . 4  |-  ( (  _E  We  z  /\  E. w  w  e.  z )  ->  E. x  e.  z  A. y  e.  z  x  C_  y
)
145, 12, 13vtocl 2673 . . 3  |-  ( (  _E  We  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) }  /\  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 )
153, 14mpan 415 . 2  |-  ( 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 )
161reg2exmidlema 4350 . 2  |-  ( E. x  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } A. y  e.  { u  e.  { (/) ,  { (/) } }  |  ( u  =  { (/) }  \/  ( u  =  (/)  /\  ph ) ) } x  C_  y  ->  ( ph  \/  -.  ph ) )
172, 15, 16mp2b 8 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    \/ wo 664    = wceq 1289   E.wex 1426    e. wcel 1438   A.wral 2359   E.wrex 2360   {crab 2363    C_ wss 2999   (/)c0 3286   {csn 3446   {cpr 3447    _E cep 4114    We wwe 4157
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3957  ax-nul 3965  ax-pow 4009  ax-pr 4036  ax-setind 4353
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-rab 2368  df-v 2621  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-nul 3287  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-br 3846  df-opab 3900  df-eprel 4116  df-frfor 4158  df-frind 4159  df-wetr 4161
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator