Theorem reapti 8458

Description: Real apartness is tight. Beyond the development of apartness itself, proofs should use apti 8501. (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

Step	Hyp	Ref	Expression
1		ltnr 7956	. . . . 5 |- ( A e. RR -> -. A < A )
2	1	adantr 274	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> -. A < A )
3		oridm 747	. . . . . 6 |- ( ( A < A \/ A < A ) <-> A < A )
4		breq2 3971	. . . . . . 7 |- ( A = B -> ( A < A <-> A < B ) )
5		breq1 3970	. . . . . . 7 |- ( A = B -> ( A < A <-> B < A ) )
6	4, 5	orbi12d 783	. . . . . 6 |- ( A = B -> ( ( A < A \/ A < A ) <-> ( A < B \/ B < A ) ) )
7	3, 6	bitr3id 193	. . . . 5 |- ( A = B -> ( A < A <-> ( A < B \/ B < A ) ) )
8	7	notbid 657	. . . 4 |- ( A = B -> ( -. A < A <-> -. ( A < B \/ B < A ) ) )
9	2, 8	syl5ibcom 154	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( A = B -> -. ( A < B \/ B < A ) ) )
10		reapval 8455	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( A #ℝ B <-> ( A < B \/ B < A ) ) )
11	10	notbid 657	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( -. A #ℝ B <-> -. ( A < B \/ B < A ) ) )
12	9, 11	sylibrd 168	. 2 |- ( ( A e. RR /\ B e. RR ) -> ( A = B -> -. A #ℝ B ) )
13		axapti 7950	. . . 4 |- ( ( A e. RR /\ B e. RR /\ -. ( A < B \/ B < A ) ) -> A = B )
14	13	3expia 1187	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( -. ( A < B \/ B < A ) -> A = B ) )
15	11, 14	sylbid 149	. 2 |- ( ( A e. RR /\ B e. RR ) -> ( -. A #ℝ B -> A = B ) )
16	12, 15	impbid 128	1 |- ( ( A e. RR /\ B e. RR ) -> ( A = B <-> -. A #ℝ B ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 698   = wceq 1335   e. wcel 2128   class class class wbr 3967   RRcr 7733   < clt 7914   #_ℝ creap 8453

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 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4084  ax-pow 4137  ax-pr 4171  ax-un 4395  ax-setind 4498  ax-cnex 7825  ax-resscn 7826  ax-pre-ltirr 7846  ax-pre-apti 7849

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-nel 2423  df-ral 2440  df-rex 2441  df-rab 2444  df-v 2714  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-pw 3546  df-sn 3567  df-pr 3568  df-op 3570  df-uni 3775  df-br 3968  df-opab 4028  df-xp 4594  df-pnf 7916  df-mnf 7917  df-ltxr 7919  df-reap 8454

This theorem is referenced by:  rimul  8464  apreap  8466  apti  8501