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

Theorem dedekindeulemuub 13162
Description: Lemma for dedekindeu 13168. Any element of the upper cut is an upper bound for the lower cut. (Contributed by Jim Kingdon, 2-Feb-2024.)
Hypotheses
Ref Expression
dedekindeu.lss  |-  ( ph  ->  L  C_  RR )
dedekindeu.uss  |-  ( ph  ->  U  C_  RR )
dedekindeu.lm  |-  ( ph  ->  E. q  e.  RR  q  e.  L )
dedekindeu.um  |-  ( ph  ->  E. r  e.  RR  r  e.  U )
dedekindeu.lr  |-  ( ph  ->  A. q  e.  RR  ( q  e.  L  <->  E. r  e.  L  q  <  r ) )
dedekindeu.ur  |-  ( ph  ->  A. r  e.  RR  ( r  e.  U  <->  E. q  e.  U  q  <  r ) )
dedekindeu.disj  |-  ( ph  ->  ( L  i^i  U
)  =  (/) )
dedekindeu.loc  |-  ( ph  ->  A. q  e.  RR  A. r  e.  RR  (
q  <  r  ->  ( q  e.  L  \/  r  e.  U )
) )
dedekindeulemuub.u  |-  ( ph  ->  A  e.  U )
Assertion
Ref Expression
dedekindeulemuub  |-  ( ph  ->  A. z  e.  L  z  <  A )
Distinct variable groups:    A, q, r, z    L, q, z    U, q, z, r    ph, q,
z
Allowed substitution hints:    ph( r)    L( r)

Proof of Theorem dedekindeulemuub
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 dedekindeulemuub.u . . 3  |-  ( ph  ->  A  e.  U )
2 eleq1 2227 . . . . 5  |-  ( r  =  A  ->  (
r  e.  U  <->  A  e.  U ) )
3 breq2 3981 . . . . . 6  |-  ( r  =  A  ->  (
q  <  r  <->  q  <  A ) )
43rexbidv 2465 . . . . 5  |-  ( r  =  A  ->  ( E. q  e.  U  q  <  r  <->  E. q  e.  U  q  <  A ) )
52, 4bibi12d 234 . . . 4  |-  ( r  =  A  ->  (
( r  e.  U  <->  E. q  e.  U  q  <  r )  <->  ( A  e.  U  <->  E. q  e.  U  q  <  A ) ) )
6 dedekindeu.ur . . . 4  |-  ( ph  ->  A. r  e.  RR  ( r  e.  U  <->  E. q  e.  U  q  <  r ) )
7 dedekindeu.uss . . . . 5  |-  ( ph  ->  U  C_  RR )
87, 1sseldd 3139 . . . 4  |-  ( ph  ->  A  e.  RR )
95, 6, 8rspcdva 2831 . . 3  |-  ( ph  ->  ( A  e.  U  <->  E. q  e.  U  q  <  A ) )
101, 9mpbid 146 . 2  |-  ( ph  ->  E. q  e.  U  q  <  A )
11 dedekindeu.lss . . . . . 6  |-  ( ph  ->  L  C_  RR )
1211ad2antrr 480 . . . . 5  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  L  C_  RR )
13 simpr 109 . . . . 5  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  z  e.  L )
1412, 13sseldd 3139 . . . 4  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  z  e.  RR )
157ad2antrr 480 . . . . 5  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  U  C_  RR )
16 simplrl 525 . . . . 5  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  q  e.  U )
1715, 16sseldd 3139 . . . 4  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  q  e.  RR )
188ad2antrr 480 . . . 4  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  A  e.  RR )
19 breq1 3980 . . . . . . . . . 10  |-  ( a  =  q  ->  (
a  <  z  <->  q  <  z ) )
2019rspcev 2826 . . . . . . . . 9  |-  ( ( q  e.  U  /\  q  <  z )  ->  E. a  e.  U  a  <  z )
2116, 20sylan 281 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  E. a  e.  U  a  <  z )
2219cbvrexv 2691 . . . . . . . 8  |-  ( E. a  e.  U  a  <  z  <->  E. q  e.  U  q  <  z )
2321, 22sylib 121 . . . . . . 7  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  E. q  e.  U  q  <  z )
24 eleq1 2227 . . . . . . . . 9  |-  ( r  =  z  ->  (
r  e.  U  <->  z  e.  U ) )
25 breq2 3981 . . . . . . . . . 10  |-  ( r  =  z  ->  (
q  <  r  <->  q  <  z ) )
2625rexbidv 2465 . . . . . . . . 9  |-  ( r  =  z  ->  ( E. q  e.  U  q  <  r  <->  E. q  e.  U  q  <  z ) )
2724, 26bibi12d 234 . . . . . . . 8  |-  ( r  =  z  ->  (
( r  e.  U  <->  E. q  e.  U  q  <  r )  <->  ( z  e.  U  <->  E. q  e.  U  q  <  z ) ) )
286ad3antrrr 484 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  A. r  e.  RR  ( r  e.  U  <->  E. q  e.  U  q  <  r ) )
2914adantr 274 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  z  e.  RR )
3027, 28, 29rspcdva 2831 . . . . . . 7  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  (
z  e.  U  <->  E. q  e.  U  q  <  z ) )
3123, 30mpbird 166 . . . . . 6  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  z  e.  U )
32 simplll 523 . . . . . . 7  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  ph )
3313adantr 274 . . . . . . 7  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  z  e.  L )
34 dedekindeu.disj . . . . . . . . 9  |-  ( ph  ->  ( L  i^i  U
)  =  (/) )
35 disj 3453 . . . . . . . . 9  |-  ( ( L  i^i  U )  =  (/)  <->  A. z  e.  L  -.  z  e.  U
)
3634, 35sylib 121 . . . . . . . 8  |-  ( ph  ->  A. z  e.  L  -.  z  e.  U
)
3736r19.21bi 2552 . . . . . . 7  |-  ( (
ph  /\  z  e.  L )  ->  -.  z  e.  U )
3832, 33, 37syl2anc 409 . . . . . 6  |-  ( ( ( ( ph  /\  ( q  e.  U  /\  q  <  A ) )  /\  z  e.  L )  /\  q  <  z )  ->  -.  z  e.  U )
3931, 38pm2.65da 651 . . . . 5  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  -.  q  <  z )
4014, 17, 39nltled 8011 . . . 4  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  z  <_  q )
41 simplrr 526 . . . 4  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  q  <  A )
4214, 17, 18, 40, 41lelttrd 8015 . . 3  |-  ( ( ( ph  /\  (
q  e.  U  /\  q  <  A ) )  /\  z  e.  L
)  ->  z  <  A )
4342ralrimiva 2537 . 2  |-  ( (
ph  /\  ( q  e.  U  /\  q  <  A ) )  ->  A. z  e.  L  z  <  A )
4410, 43rexlimddv 2586 1  |-  ( ph  ->  A. z  e.  L  z  <  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 698    = wceq 1342    e. wcel 2135   A.wral 2442   E.wrex 2443    i^i cin 3111    C_ wss 3112   (/)c0 3405   class class class wbr 3977   RRcr 7744    < clt 7925
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4095  ax-pow 4148  ax-pr 4182  ax-un 4406  ax-setind 4509  ax-cnex 7836  ax-resscn 7837  ax-pre-ltwlin 7858
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-nel 2430  df-ral 2447  df-rex 2448  df-rab 2451  df-v 2724  df-dif 3114  df-un 3116  df-in 3118  df-ss 3125  df-nul 3406  df-pw 3556  df-sn 3577  df-pr 3578  df-op 3580  df-uni 3785  df-br 3978  df-opab 4039  df-xp 4605  df-cnv 4607  df-pnf 7927  df-mnf 7928  df-xr 7929  df-ltxr 7930  df-le 7931
This theorem is referenced by:  dedekindeulemub  13163  dedekindeulemloc  13164
  Copyright terms: Public domain W3C validator