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

Theorem onsucelsucexmidlem 4633
Description: Lemma for onsucelsucexmid 4634. The set  { x  e. 
{ (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } appears as  A in the proof of Theorem 1.3 in [Bauer] p. 483 (see acexmidlema 6019), and similar sets also appear in other proofs that various propositions imply excluded middle, for example in ordtriexmidlem 4623. (Contributed by Jim Kingdon, 2-Aug-2019.)
Assertion
Ref Expression
onsucelsucexmidlem  |-  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  e.  On
Distinct variable group:    ph, x

Proof of Theorem onsucelsucexmidlem
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 527 . . . . . . . 8  |-  ( ( ( y  e.  z  /\  z  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )  /\  z  =  (/) )  ->  y  e.  z )
2 noel 3500 . . . . . . . . . 10  |-  -.  y  e.  (/)
3 eleq2 2295 . . . . . . . . . 10  |-  ( z  =  (/)  ->  ( y  e.  z  <->  y  e.  (/) ) )
42, 3mtbiri 682 . . . . . . . . 9  |-  ( z  =  (/)  ->  -.  y  e.  z )
54adantl 277 . . . . . . . 8  |-  ( ( ( y  e.  z  /\  z  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )  /\  z  =  (/) )  ->  -.  y  e.  z )
61, 5pm2.21dd 625 . . . . . . 7  |-  ( ( ( y  e.  z  /\  z  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )  /\  z  =  (/) )  ->  y  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )
76ex 115 . . . . . 6  |-  ( ( y  e.  z  /\  z  e.  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )  ->  (
z  =  (/)  ->  y  e.  { x  e.  { (/)
,  { (/) } }  |  ( x  =  (/)  \/  ph ) } ) )
8 eleq2 2295 . . . . . . . . . . 11  |-  ( z  =  { (/) }  ->  ( y  e.  z  <->  y  e.  {
(/) } ) )
98biimpac 298 . . . . . . . . . 10  |-  ( ( y  e.  z  /\  z  =  { (/) } )  ->  y  e.  { (/)
} )
10 velsn 3690 . . . . . . . . . 10  |-  ( y  e.  { (/) }  <->  y  =  (/) )
119, 10sylib 122 . . . . . . . . 9  |-  ( ( y  e.  z  /\  z  =  { (/) } )  ->  y  =  (/) )
12 onsucelsucexmidlem1 4632 . . . . . . . . 9  |-  (/)  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) }
1311, 12eqeltrdi 2322 . . . . . . . 8  |-  ( ( y  e.  z  /\  z  =  { (/) } )  ->  y  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )
1413ex 115 . . . . . . 7  |-  ( y  e.  z  ->  (
z  =  { (/) }  ->  y  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } ) )
1514adantr 276 . . . . . 6  |-  ( ( y  e.  z  /\  z  e.  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )  ->  (
z  =  { (/) }  ->  y  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } ) )
16 elrabi 2960 . . . . . . . 8  |-  ( z  e.  { x  e. 
{ (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  ->  z  e.  { (/)
,  { (/) } }
)
17 vex 2806 . . . . . . . . 9  |-  z  e. 
_V
1817elpr 3694 . . . . . . . 8  |-  ( z  e.  { (/) ,  { (/)
} }  <->  ( z  =  (/)  \/  z  =  { (/) } ) )
1916, 18sylib 122 . . . . . . 7  |-  ( z  e.  { x  e. 
{ (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  ->  ( z  =  (/)  \/  z  =  { (/)
} ) )
2019adantl 277 . . . . . 6  |-  ( ( y  e.  z  /\  z  e.  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )  ->  (
z  =  (/)  \/  z  =  { (/) } ) )
217, 15, 20mpjaod 726 . . . . 5  |-  ( ( y  e.  z  /\  z  e.  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )  ->  y  e.  { x  e.  { (/)
,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )
2221gen2 1499 . . . 4  |-  A. y A. z ( ( y  e.  z  /\  z  e.  { x  e.  { (/)
,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )  ->  y  e.  { x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )
23 dftr2 4194 . . . 4  |-  ( Tr 
{ x  e.  { (/)
,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  <->  A. y A. z ( ( y  e.  z  /\  z  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } )  ->  y  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) } ) )
2422, 23mpbir 146 . . 3  |-  Tr  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) }
25 ssrab2 3313 . . 3  |-  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  C_  { (/) ,  { (/)
} }
26 2ordpr 4628 . . 3  |-  Ord  { (/)
,  { (/) } }
27 trssord 4483 . . 3  |-  ( ( Tr  { x  e. 
{ (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  /\  { x  e. 
{ (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  C_  { (/) ,  { (/)
} }  /\  Ord  {
(/) ,  { (/) } }
)  ->  Ord  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )
2824, 25, 26, 27mp3an 1374 . 2  |-  Ord  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) }
29 pp0ex 4285 . . . 4  |-  { (/) ,  { (/) } }  e.  _V
3029rabex 4239 . . 3  |-  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  e.  _V
3130elon 4477 . 2  |-  ( { x  e.  { (/) ,  { (/) } }  | 
( x  =  (/)  \/ 
ph ) }  e.  On 
<->  Ord  { x  e. 
{ (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) } )
3228, 31mpbir 146 1  |-  { x  e.  { (/) ,  { (/) } }  |  ( x  =  (/)  \/  ph ) }  e.  On
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716   A.wal 1396    = wceq 1398    e. wcel 2202   {crab 2515    C_ wss 3201   (/)c0 3496   {csn 3673   {cpr 3674   Tr wtr 4192   Ord word 4465   Oncon0 4466
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-uni 3899  df-tr 4193  df-iord 4469  df-on 4471  df-suc 4474
This theorem is referenced by:  onsucelsucexmid  4634  acexmidlemcase  6023  acexmidlemv  6026
  Copyright terms: Public domain W3C validator