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

Theorem reapti 8855
Description: Real apartness is tight. Beyond the development of apartness itself, proofs should use apti 8898. (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 8352 . . . . 5  |-  ( A  e.  RR  ->  -.  A  <  A )
21adantr 276 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  -.  A  <  A
)
3 oridm 765 . . . . . 6  |-  ( ( A  <  A  \/  A  <  A )  <->  A  <  A )
4 breq2 4115 . . . . . . 7  |-  ( A  =  B  ->  ( A  <  A  <->  A  <  B ) )
5 breq1 4114 . . . . . . 7  |-  ( A  =  B  ->  ( A  <  A  <->  B  <  A ) )
64, 5orbi12d 801 . . . . . 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 8852 . . . 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 8346 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  -.  ( A  <  B  \/  B  <  A ) )  ->  A  =  B )
14133expia 1232 . . 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 716    = wceq 1398    e. wcel 2205   class class class wbr 4111   RRcr 8128    < clt 8310   # creap 8850
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-pre-ltirr 8241  ax-pre-apti 8244
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-xp 4757  df-pnf 8312  df-mnf 8313  df-ltxr 8315  df-reap 8851
This theorem is referenced by:  rimul  8861  apreap  8863  apti  8898
  Copyright terms: Public domain W3C validator