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

Theorem onintexmid 4718
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 3871 . . . . . 6  |-  ( ( u  e.  On  /\  v  e.  On )  ->  { u ,  v }  C_  On )
2 prmg 3833 . . . . . . 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 4345 . . . . . . 7  |-  { u ,  v }  e.  _V
5 sseq1 3271 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  (
y  C_  On  <->  { u ,  v }  C_  On ) )
6 eleq2 2302 . . . . . . . . . 10  |-  ( y  =  { u ,  v }  ->  (
x  e.  y  <->  x  e.  { u ,  v } ) )
76exbidv 1878 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  ( E. x  x  e.  y 
<->  E. x  x  e. 
{ u ,  v } ) )
85, 7anbi12d 477 . . . . . . . 8  |-  ( y  =  { u ,  v }  ->  (
( y  C_  On  /\ 
E. x  x  e.  y )  <->  ( {
u ,  v } 
C_  On  /\  E. x  x  e.  { u ,  v } ) ) )
9 inteq 3971 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  |^| y  =  |^| { u ,  v } )
10 id 19 . . . . . . . . 9  |-  ( y  =  { u ,  v }  ->  y  =  { u ,  v } )
119, 10eleq12d 2309 . . . . . . . 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 2877 . . . . . 6  |-  ( ( { u ,  v }  C_  On  /\  E. x  x  e.  { u ,  v } )  ->  |^| { u ,  v }  e.  {
u ,  v } )
151, 3, 14syl2anc 415 . . . . 5  |-  ( ( u  e.  On  /\  v  e.  On )  ->  |^| { u ,  v }  e.  {
u ,  v } )
16 elpri 3731 . . . . 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 3421 . . . . . . 7  |-  ( v  i^i  u )  =  ( u  i^i  v
)
1918eqeq1i 2246 . . . . . 6  |-  ( ( v  i^i  u )  =  u  <->  ( u  i^i  v )  =  u )
20 dfss1 3435 . . . . . 6  |-  ( u 
C_  v  <->  ( v  i^i  u )  =  u )
21 vex 2824 . . . . . . . 8  |-  u  e. 
_V
22 vex 2824 . . . . . . . 8  |-  v  e. 
_V
2321, 22intpr 4000 . . . . . . 7  |-  |^| { u ,  v }  =  ( u  i^i  v
)
2423eqeq1i 2246 . . . . . 6  |-  ( |^| { u ,  v }  =  u  <->  ( u  i^i  v )  =  u )
2519, 20, 243bitr4ri 213 . . . . 5  |-  ( |^| { u ,  v }  =  u  <->  u  C_  v
)
2623eqeq1i 2246 . . . . . 6  |-  ( |^| { u ,  v }  =  v  <->  ( u  i^i  v )  =  v )
27 dfss1 3435 . . . . . 6  |-  ( v 
C_  u  <->  ( u  i^i  v )  =  v )
2826, 27bitr4i 187 . . . . 5  |-  ( |^| { u ,  v }  =  v  <->  v  C_  u )
2925, 28orbi12i 776 . . . 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 2604 . 2  |-  A. u  e.  On  A. v  e.  On  ( u  C_  v  \/  v  C_  u )
3231ordtri2or2exmid 4716 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402   E.wex 1545    e. wcel 2209    i^i cin 3219    C_ wss 3220   {cpr 3709   |^|cint 3968   Oncon0 4506
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-uni 3934  df-int 3969  df-tr 4228  df-iord 4509  df-on 4511  df-suc 4514
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator