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

Theorem dedekindeulemeu 12769
Description: Lemma for dedekindeu 12770. 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 3932 . . . 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 111 . . . . 5  |-  ( ph  ->  A. q  e.  L  q  <  A )
43adantr 274 . . . 4  |-  ( (
ph  /\  A  e.  L )  ->  A. q  e.  L  q  <  A )
5 simpr 109 . . . 4  |-  ( (
ph  /\  A  e.  L )  ->  A  e.  L )
61, 4, 5rspcdva 2794 . . 3  |-  ( (
ph  /\  A  e.  L )  ->  A  <  A )
7 dedekindeulemeu.are . . . . 5  |-  ( ph  ->  A  e.  RR )
87ltnrd 7875 . . . 4  |-  ( ph  ->  -.  A  <  A
)
98adantr 274 . . 3  |-  ( (
ph  /\  A  e.  L )  ->  -.  A  <  A )
106, 9pm2.21fal 1351 . 2  |-  ( (
ph  /\  A  e.  L )  -> F.  )
11 breq2 3933 . . . 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 113 . . . . 5  |-  ( ph  ->  A. r  e.  U  B  <  r )
1413adantr 274 . . . 4  |-  ( (
ph  /\  B  e.  U )  ->  A. r  e.  U  B  <  r )
15 simpr 109 . . . 4  |-  ( (
ph  /\  B  e.  U )  ->  B  e.  U )
1611, 14, 15rspcdva 2794 . . 3  |-  ( (
ph  /\  B  e.  U )  ->  B  <  B )
17 dedekindeulemeu.bre . . . . 5  |-  ( ph  ->  B  e.  RR )
1817ltnrd 7875 . . . 4  |-  ( ph  ->  -.  B  <  B
)
1918adantr 274 . . 3  |-  ( (
ph  /\  B  e.  U )  ->  -.  B  <  B )
2016, 19pm2.21fal 1351 . 2  |-  ( (
ph  /\  B  e.  U )  -> F.  )
21 dedekindeulemeu.lt . . 3  |-  ( ph  ->  A  <  B )
22 breq2 3933 . . . . 5  |-  ( r  =  B  ->  ( A  <  r  <->  A  <  B ) )
23 eleq1 2202 . . . . . 6  |-  ( r  =  B  ->  (
r  e.  U  <->  B  e.  U ) )
2423orbi2d 779 . . . . 5  |-  ( r  =  B  ->  (
( A  e.  L  \/  r  e.  U
)  <->  ( A  e.  L  \/  B  e.  U ) ) )
2522, 24imbi12d 233 . . . 4  |-  ( r  =  B  ->  (
( A  <  r  ->  ( A  e.  L  \/  r  e.  U
) )  <->  ( A  <  B  ->  ( A  e.  L  \/  B  e.  U ) ) ) )
26 breq1 3932 . . . . . . 7  |-  ( q  =  A  ->  (
q  <  r  <->  A  <  r ) )
27 eleq1 2202 . . . . . . . 8  |-  ( q  =  A  ->  (
q  e.  L  <->  A  e.  L ) )
2827orbi1d 780 . . . . . . 7  |-  ( q  =  A  ->  (
( q  e.  L  \/  r  e.  U
)  <->  ( A  e.  L  \/  r  e.  U ) ) )
2926, 28imbi12d 233 . . . . . 6  |-  ( q  =  A  ->  (
( q  <  r  ->  ( q  e.  L  \/  r  e.  U
) )  <->  ( A  <  r  ->  ( A  e.  L  \/  r  e.  U ) ) ) )
3029ralbidv 2437 . . . . 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 2794 . . . 4  |-  ( ph  ->  A. r  e.  RR  ( A  <  r  -> 
( A  e.  L  \/  r  e.  U
) ) )
3325, 32, 17rspcdva 2794 . . 3  |-  ( ph  ->  ( A  <  B  ->  ( A  e.  L  \/  B  e.  U
) ) )
3421, 33mpd 13 . 2  |-  ( ph  ->  ( A  e.  L  \/  B  e.  U
) )
3510, 20, 34mpjaodan 787 1  |-  ( ph  -> F.  )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 697    = wceq 1331   F. wfal 1336    e. wcel 1480   A.wral 2416   E.wrex 2417    i^i cin 3070    C_ wss 3071   (/)c0 3363   class class class wbr 3929   RRcr 7619    < clt 7800
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7711  ax-resscn 7712  ax-pre-ltirr 7732
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-xp 4545  df-pnf 7802  df-mnf 7803  df-ltxr 7805
This theorem is referenced by:  dedekindeu  12770
  Copyright terms: Public domain W3C validator