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

Theorem reapti 8758
Description: Real apartness is tight. Beyond the development of apartness itself, proofs should use apti 8801. (Contributed by Jim Kingdon, 30-Jan-2020.) (New usage is discouraged.)
Assertion
Ref Expression
reapti  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  =  B  <->  -.  A #  B ) )

Proof of Theorem reapti
StepHypRef Expression
1 ltnr 8255 . . . . 5  |-  ( A  e.  RR  ->  -.  A  <  A )
21adantr 276 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  -.  A  <  A
)
3 oridm 764 . . . . . 6  |-  ( ( A  <  A  \/  A  <  A )  <->  A  <  A )
4 breq2 4092 . . . . . . 7  |-  ( A  =  B  ->  ( A  <  A  <->  A  <  B ) )
5 breq1 4091 . . . . . . 7  |-  ( A  =  B  ->  ( A  <  A  <->  B  <  A ) )
64, 5orbi12d 800 . . . . . 6  |-  ( A  =  B  ->  (
( A  <  A  \/  A  <  A )  <-> 
( A  <  B  \/  B  <  A ) ) )
73, 6bitr3id 194 . . . . 5  |-  ( A  =  B  ->  ( A  <  A  <->  ( A  <  B  \/  B  < 
A ) ) )
87notbid 673 . . . 4  |-  ( A  =  B  ->  ( -.  A  <  A  <->  -.  ( A  <  B  \/  B  <  A ) ) )
92, 8syl5ibcom 155 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  =  B  ->  -.  ( A  <  B  \/  B  < 
A ) ) )
10 reapval 8755 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A #  B  <->  ( A  < 
B  \/  B  < 
A ) ) )
1110notbid 673 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( -.  A #  B  <->  -.  ( A  <  B  \/  B  <  A ) ) )
129, 11sylibrd 169 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  =  B  ->  -.  A #  B )
)
13 axapti 8249 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  -.  ( A  <  B  \/  B  <  A ) )  ->  A  =  B )
14133expia 1231 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( -.  ( A  <  B  \/  B  <  A )  ->  A  =  B ) )
1511, 14sylbid 150 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( -.  A #  B  ->  A  =  B )
)
1612, 15impbid 129 1  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  =  B  <->  -.  A #  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 715    = wceq 1397    e. wcel 2202   class class class wbr 4088   RRcr 8030    < clt 8213   # creap 8753
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-pre-ltirr 8143  ax-pre-apti 8146
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-reap 8754
This theorem is referenced by:  rimul  8764  apreap  8766  apti  8801
  Copyright terms: Public domain W3C validator