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

Theorem onintexmid 4584
Description: If the intersection (infimum) of an inhabited class of ordinal numbers belongs to the class, excluded middle follows. The hypothesis would be provable given excluded middle. (Contributed by Mario Carneiro and Jim Kingdon, 29-Aug-2021.)
Hypothesis
Ref Expression
onintexmid.onint  |-  ( ( y  C_  On  /\  E. x  x  e.  y
)  ->  |^| y  e.  y )
Assertion
Ref Expression
onintexmid  |-  ( ph  \/  -.  ph )
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem onintexmid
Dummy variables  u  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prssi 3762 . . . . . 6  |-  ( ( u  e.  On  /\  v  e.  On )  ->  { u ,  v }  C_  On )
2 prmg 3725 . . . . . . 7  |-  ( u  e.  On  ->  E. x  x  e.  { u ,  v } )
32adantr 276 . . . . . 6  |-  ( ( u  e.  On  /\  v  e.  On )  ->  E. x  x  e. 
{ u ,  v } )
4 zfpair2 4222 . . . . . . 7  |-  { u ,  v }  e.  _V
5 sseq1 3190 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  (
y  C_  On  <->  { u ,  v }  C_  On ) )
6 eleq2 2251 . . . . . . . . . 10  |-  ( y  =  { u ,  v }  ->  (
x  e.  y  <->  x  e.  { u ,  v } ) )
76exbidv 1835 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  ( E. x  x  e.  y 
<->  E. x  x  e. 
{ u ,  v } ) )
85, 7anbi12d 473 . . . . . . . 8  |-  ( y  =  { u ,  v }  ->  (
( y  C_  On  /\ 
E. x  x  e.  y )  <->  ( {
u ,  v } 
C_  On  /\  E. x  x  e.  { u ,  v } ) ) )
9 inteq 3859 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  |^| y  =  |^| { u ,  v } )
10 id 19 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  y  =  { u ,  v } )
119, 10eleq12d 2258 . . . . . . . 8  |-  ( y  =  { u ,  v }  ->  ( |^| y  e.  y  <->  |^|
{ u ,  v }  e.  { u ,  v } ) )
128, 11imbi12d 234 . . . . . . 7  |-  ( y  =  { u ,  v }  ->  (
( ( y  C_  On  /\  E. x  x  e.  y )  ->  |^| y  e.  y
)  <->  ( ( { u ,  v } 
C_  On  /\  E. x  x  e.  { u ,  v } )  ->  |^| { u ,  v }  e.  {
u ,  v } ) ) )
13 onintexmid.onint . . . . . . 7  |-  ( ( y  C_  On  /\  E. x  x  e.  y
)  ->  |^| y  e.  y )
144, 12, 13vtocl 2803 . . . . . 6  |-  ( ( { u ,  v }  C_  On  /\  E. x  x  e.  { u ,  v } )  ->  |^| { u ,  v }  e.  {
u ,  v } )
151, 3, 14syl2anc 411 . . . . 5  |-  ( ( u  e.  On  /\  v  e.  On )  ->  |^| { u ,  v }  e.  {
u ,  v } )
16 elpri 3627 . . . . 5  |-  ( |^| { u ,  v }  e.  { u ,  v }  ->  ( |^| { u ,  v }  =  u  \/ 
|^| { u ,  v }  =  v ) )
1715, 16syl 14 . . . 4  |-  ( ( u  e.  On  /\  v  e.  On )  ->  ( |^| { u ,  v }  =  u  \/  |^| { u ,  v }  =  v ) )
18 incom 3339 . . . . . . 7  |-  ( v  i^i  u )  =  ( u  i^i  v
)
1918eqeq1i 2195 . . . . . 6  |-  ( ( v  i^i  u )  =  u  <->  ( u  i^i  v )  =  u )
20 dfss1 3351 . . . . . 6  |-  ( u 
C_  v  <->  ( v  i^i  u )  =  u )
21 vex 2752 . . . . . . . 8  |-  u  e. 
_V
22 vex 2752 . . . . . . . 8  |-  v  e. 
_V
2321, 22intpr 3888 . . . . . . 7  |-  |^| { u ,  v }  =  ( u  i^i  v
)
2423eqeq1i 2195 . . . . . 6  |-  ( |^| { u ,  v }  =  u  <->  ( u  i^i  v )  =  u )
2519, 20, 243bitr4ri 213 . . . . 5  |-  ( |^| { u ,  v }  =  u  <->  u  C_  v
)
2623eqeq1i 2195 . . . . . 6  |-  ( |^| { u ,  v }  =  v  <->  ( u  i^i  v )  =  v )
27 dfss1 3351 . . . . . 6  |-  ( v 
C_  u  <->  ( u  i^i  v )  =  v )
2826, 27bitr4i 187 . . . . 5  |-  ( |^| { u ,  v }  =  v  <->  v  C_  u )
2925, 28orbi12i 765 . . . 4  |-  ( (
|^| { u ,  v }  =  u  \/ 
|^| { u ,  v }  =  v )  <-> 
( u  C_  v  \/  v  C_  u ) )
3017, 29sylib 122 . . 3  |-  ( ( u  e.  On  /\  v  e.  On )  ->  ( u  C_  v  \/  v  C_  u ) )
3130rgen2a 2541 . 2  |-  A. u  e.  On  A. v  e.  On  ( u  C_  v  \/  v  C_  u )
3231ordtri2or2exmid 4582 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 709    = wceq 1363   E.wex 1502    e. wcel 2158    i^i cin 3140    C_ wss 3141   {cpr 3605   |^|cint 3856   Oncon0 4375
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-uni 3822  df-int 3857  df-tr 4114  df-iord 4378  df-on 4380  df-suc 4383
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator