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

Theorem dedekindeulemeu 13942
Description: Lemma for dedekindeu 13943. Part of proving uniqueness. (Contributed by Jim Kingdon, 31-Jan-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 )
) )
dedekindeulemeu.are  |-  ( ph  ->  A  e.  RR )
dedekindeulemeu.ac  |-  ( ph  ->  ( A. q  e.  L  q  <  A  /\  A. r  e.  U  A  <  r ) )
dedekindeulemeu.bre  |-  ( ph  ->  B  e.  RR )
dedekindeulemeu.bc  |-  ( ph  ->  ( A. q  e.  L  q  <  B  /\  A. r  e.  U  B  <  r ) )
dedekindeulemeu.lt  |-  ( ph  ->  A  <  B )
Assertion
Ref Expression
dedekindeulemeu  |-  ( ph  -> F.  )
Distinct variable groups:    A, q, r    B, r    L, q, r    U, q, r
Allowed substitution hints:    ph( r, q)    B( q)

Proof of Theorem dedekindeulemeu
StepHypRef Expression
1 breq1 4004 . . . 4  |-  ( q  =  A  ->  (
q  <  A  <->  A  <  A ) )
2 dedekindeulemeu.ac . . . . . 6  |-  ( ph  ->  ( A. q  e.  L  q  <  A  /\  A. r  e.  U  A  <  r ) )
32simpld 112 . . . . 5  |-  ( ph  ->  A. q  e.  L  q  <  A )
43adantr 276 . . . 4  |-  ( (
ph  /\  A  e.  L )  ->  A. q  e.  L  q  <  A )
5 simpr 110 . . . 4  |-  ( (
ph  /\  A  e.  L )  ->  A  e.  L )
61, 4, 5rspcdva 2846 . . 3  |-  ( (
ph  /\  A  e.  L )  ->  A  <  A )
7 dedekindeulemeu.are . . . . 5  |-  ( ph  ->  A  e.  RR )
87ltnrd 8063 . . . 4  |-  ( ph  ->  -.  A  <  A
)
98adantr 276 . . 3  |-  ( (
ph  /\  A  e.  L )  ->  -.  A  <  A )
106, 9pm2.21fal 1373 . 2  |-  ( (
ph  /\  A  e.  L )  -> F.  )
11 breq2 4005 . . . 4  |-  ( r  =  B  ->  ( B  <  r  <->  B  <  B ) )
12 dedekindeulemeu.bc . . . . . 6  |-  ( ph  ->  ( A. q  e.  L  q  <  B  /\  A. r  e.  U  B  <  r ) )
1312simprd 114 . . . . 5  |-  ( ph  ->  A. r  e.  U  B  <  r )
1413adantr 276 . . . 4  |-  ( (
ph  /\  B  e.  U )  ->  A. r  e.  U  B  <  r )
15 simpr 110 . . . 4  |-  ( (
ph  /\  B  e.  U )  ->  B  e.  U )
1611, 14, 15rspcdva 2846 . . 3  |-  ( (
ph  /\  B  e.  U )  ->  B  <  B )
17 dedekindeulemeu.bre . . . . 5  |-  ( ph  ->  B  e.  RR )
1817ltnrd 8063 . . . 4  |-  ( ph  ->  -.  B  <  B
)
1918adantr 276 . . 3  |-  ( (
ph  /\  B  e.  U )  ->  -.  B  <  B )
2016, 19pm2.21fal 1373 . 2  |-  ( (
ph  /\  B  e.  U )  -> F.  )
21 dedekindeulemeu.lt . . 3  |-  ( ph  ->  A  <  B )
22 breq2 4005 . . . . 5  |-  ( r  =  B  ->  ( A  <  r  <->  A  <  B ) )
23 eleq1 2240 . . . . . 6  |-  ( r  =  B  ->  (
r  e.  U  <->  B  e.  U ) )
2423orbi2d 790 . . . . 5  |-  ( r  =  B  ->  (
( A  e.  L  \/  r  e.  U
)  <->  ( A  e.  L  \/  B  e.  U ) ) )
2522, 24imbi12d 234 . . . 4  |-  ( r  =  B  ->  (
( A  <  r  ->  ( A  e.  L  \/  r  e.  U
) )  <->  ( A  <  B  ->  ( A  e.  L  \/  B  e.  U ) ) ) )
26 breq1 4004 . . . . . . 7  |-  ( q  =  A  ->  (
q  <  r  <->  A  <  r ) )
27 eleq1 2240 . . . . . . . 8  |-  ( q  =  A  ->  (
q  e.  L  <->  A  e.  L ) )
2827orbi1d 791 . . . . . . 7  |-  ( q  =  A  ->  (
( q  e.  L  \/  r  e.  U
)  <->  ( A  e.  L  \/  r  e.  U ) ) )
2926, 28imbi12d 234 . . . . . 6  |-  ( q  =  A  ->  (
( q  <  r  ->  ( q  e.  L  \/  r  e.  U
) )  <->  ( A  <  r  ->  ( A  e.  L  \/  r  e.  U ) ) ) )
3029ralbidv 2477 . . . . 5  |-  ( q  =  A  ->  ( A. r  e.  RR  ( q  <  r  ->  ( q  e.  L  \/  r  e.  U
) )  <->  A. r  e.  RR  ( A  < 
r  ->  ( A  e.  L  \/  r  e.  U ) ) ) )
31 dedekindeu.loc . . . . 5  |-  ( ph  ->  A. q  e.  RR  A. r  e.  RR  (
q  <  r  ->  ( q  e.  L  \/  r  e.  U )
) )
3230, 31, 7rspcdva 2846 . . . 4  |-  ( ph  ->  A. r  e.  RR  ( A  <  r  -> 
( A  e.  L  \/  r  e.  U
) ) )
3325, 32, 17rspcdva 2846 . . 3  |-  ( ph  ->  ( A  <  B  ->  ( A  e.  L  \/  B  e.  U
) ) )
3421, 33mpd 13 . 2  |-  ( ph  ->  ( A  e.  L  \/  B  e.  U
) )
3510, 20, 34mpjaodan 798 1  |-  ( ph  -> F.  )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    = wceq 1353   F. wfal 1358    e. wcel 2148   A.wral 2455   E.wrex 2456    i^i cin 3128    C_ wss 3129   (/)c0 3422   class class class wbr 4001   RRcr 7805    < clt 7986
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-pow 4172  ax-pr 4207  ax-un 4431  ax-setind 4534  ax-cnex 7897  ax-resscn 7898  ax-pre-ltirr 7918
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3809  df-br 4002  df-opab 4063  df-xp 4630  df-pnf 7988  df-mnf 7989  df-ltxr 7991
This theorem is referenced by:  dedekindeu  13943
  Copyright terms: Public domain W3C validator