Theorem aptisr 8152

Description: Apartness of signed reals is tight. (Contributed by Jim Kingdon, 29-Jan-2020.)

Assertion

Ref	Expression
aptisr	|- ( ( A e. R. /\ B e. R. /\ -. ( A <R B \/ B <R A ) ) -> A = B )

Proof of Theorem aptisr

Dummy variables w x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nr 8100	. . 3 |- R. = ( ( P. X. P. ) /. ~R )
2		breq1 4134	. . . . . 6 |- ( [ <. x , y >. ] ~R = A -> ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R <-> A <R [ <. z , w >. ] ~R ) )
3		breq2 4135	. . . . . 6 |- ( [ <. x , y >. ] ~R = A -> ( [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R <-> [ <. z , w >. ] ~R <R A ) )
4	2, 3	orbi12d 805	. . . . 5 |- ( [ <. x , y >. ] ~R = A -> ( ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R ) <-> ( A <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R A ) ) )
5	4	notbid 677	. . . 4 |- ( [ <. x , y >. ] ~R = A -> ( -. ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R ) <-> -. ( A <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R A ) ) )
6		eqeq1 2245	. . . 4 |- ( [ <. x , y >. ] ~R = A -> ( [ <. x , y >. ] ~R = [ <. z , w >. ] ~R <-> A = [ <. z , w >. ] ~R ) )
7	5, 6	imbi12d 234	. . 3 |- ( [ <. x , y >. ] ~R = A -> ( ( -. ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R ) -> [ <. x , y >. ] ~R = [ <. z , w >. ] ~R ) <-> ( -. ( A <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R A ) -> A = [ <. z , w >. ] ~R ) ) )
8		breq2 4135	. . . . . 6 |- ( [ <. z , w >. ] ~R = B -> ( A <R [ <. z , w >. ] ~R <-> A <R B ) )
9		breq1 4134	. . . . . 6 |- ( [ <. z , w >. ] ~R = B -> ( [ <. z , w >. ] ~R <R A <-> B <R A ) )
10	8, 9	orbi12d 805	. . . . 5 |- ( [ <. z , w >. ] ~R = B -> ( ( A <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R A ) <-> ( A <R B \/ B <R A ) ) )
11	10	notbid 677	. . . 4 |- ( [ <. z , w >. ] ~R = B -> ( -. ( A <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R A ) <-> -. ( A <R B \/ B <R A ) ) )
12		eqeq2 2248	. . . 4 |- ( [ <. z , w >. ] ~R = B -> ( A = [ <. z , w >. ] ~R <-> A = B ) )
13	11, 12	imbi12d 234	. . 3 |- ( [ <. z , w >. ] ~R = B -> ( ( -. ( A <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R A ) -> A = [ <. z , w >. ] ~R ) <-> ( -. ( A <R B \/ B <R A ) -> A = B ) ) )
14		addcomprg 7951	. . . . . . . . 9 |- ( ( y e. P. /\ z e. P. ) -> ( y +P. z ) = ( z +P. y ) )
15	14	ad2ant2lr 514	. . . . . . . 8 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( y +P. z ) = ( z +P. y ) )
16		addcomprg 7951	. . . . . . . . 9 |- ( ( x e. P. /\ w e. P. ) -> ( x +P. w ) = ( w +P. x ) )
17	16	ad2ant2rl 515	. . . . . . . 8 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( x +P. w ) = ( w +P. x ) )
18	15, 17	breq12d 4144	. . . . . . 7 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( ( y +P. z ) <P ( x +P. w ) <-> ( z +P. y ) <P ( w +P. x ) ) )
19	18	orbi2d 802	. . . . . 6 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( ( ( x +P. w ) <P ( y +P. z ) \/ ( y +P. z ) <P ( x +P. w ) ) <-> ( ( x +P. w ) <P ( y +P. z ) \/ ( z +P. y ) <P ( w +P. x ) ) ) )
20	19	notbid 677	. . . . 5 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( -. ( ( x +P. w ) <P ( y +P. z ) \/ ( y +P. z ) <P ( x +P. w ) ) <-> -. ( ( x +P. w ) <P ( y +P. z ) \/ ( z +P. y ) <P ( w +P. x ) ) ) )
21		addclpr 7910	. . . . . . 7 |- ( ( x e. P. /\ w e. P. ) -> ( x +P. w ) e. P. )
22	21	ad2ant2rl 515	. . . . . 6 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( x +P. w ) e. P. )
23		addclpr 7910	. . . . . . 7 |- ( ( y e. P. /\ z e. P. ) -> ( y +P. z ) e. P. )
24	23	ad2ant2lr 514	. . . . . 6 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( y +P. z ) e. P. )
25		aptipr 8014	. . . . . . 7 |- ( ( ( x +P. w ) e. P. /\ ( y +P. z ) e. P. /\ -. ( ( x +P. w ) <P ( y +P. z ) \/ ( y +P. z ) <P ( x +P. w ) ) ) -> ( x +P. w ) = ( y +P. z ) )
26	25	3expia 1236	. . . . . 6 |- ( ( ( x +P. w ) e. P. /\ ( y +P. z ) e. P. ) -> ( -. ( ( x +P. w ) <P ( y +P. z ) \/ ( y +P. z ) <P ( x +P. w ) ) -> ( x +P. w ) = ( y +P. z ) ) )
27	22, 24, 26	syl2anc 415	. . . . 5 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( -. ( ( x +P. w ) <P ( y +P. z ) \/ ( y +P. z ) <P ( x +P. w ) ) -> ( x +P. w ) = ( y +P. z ) ) )
28	20, 27	sylbird 170	. . . 4 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( -. ( ( x +P. w ) <P ( y +P. z ) \/ ( z +P. y ) <P ( w +P. x ) ) -> ( x +P. w ) = ( y +P. z ) ) )
29		ltsrprg 8120	. . . . . 6 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R <-> ( x +P. w ) <P ( y +P. z ) ) )
30		ltsrprg 8120	. . . . . . 7 |- ( ( ( z e. P. /\ w e. P. ) /\ ( x e. P. /\ y e. P. ) ) -> ( [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R <-> ( z +P. y ) <P ( w +P. x ) ) )
31	30	ancoms 268	. . . . . 6 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R <-> ( z +P. y ) <P ( w +P. x ) ) )
32	29, 31	orbi12d 805	. . . . 5 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R ) <-> ( ( x +P. w ) <P ( y +P. z ) \/ ( z +P. y ) <P ( w +P. x ) ) ) )
33	32	notbid 677	. . . 4 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( -. ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R ) <-> -. ( ( x +P. w ) <P ( y +P. z ) \/ ( z +P. y ) <P ( w +P. x ) ) ) )
34		enreceq 8109	. . . 4 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( [ <. x , y >. ] ~R = [ <. z , w >. ] ~R <-> ( x +P. w ) = ( y +P. z ) ) )
35	28, 33, 34	3imtr4d 203	. . 3 |- ( ( ( x e. P. /\ y e. P. ) /\ ( z e. P. /\ w e. P. ) ) -> ( -. ( [ <. x , y >. ] ~R <R [ <. z , w >. ] ~R \/ [ <. z , w >. ] ~R <R [ <. x , y >. ] ~R ) -> [ <. x , y >. ] ~R = [ <. z , w >. ] ~R ) )
36	1, 7, 13, 35	2ecoptocl 6901	. 2 |- ( ( A e. R. /\ B e. R. ) -> ( -. ( A <R B \/ B <R A ) -> A = B ) )
37	36	3impia 1231	1 |- ( ( A e. R. /\ B e. R. /\ -. ( A <R B \/ B <R A ) ) -> A = B )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   <.cop 3712   class class class wbr 4131  (class class class)co 6088   [cec 6809   P.cnp 7664   +P. cpp 7666   <P cltp 7668   ~R cer 7669   R.cnr 7670   <R cltr 7676

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-mqqs 7723  df-1nqqs 7724  df-rq 7725  df-ltnqqs 7726  df-enq0 7797  df-nq0 7798  df-0nq0 7799  df-plq0 7800  df-mq0 7801  df-inp 7839  df-iplp 7841  df-iltp 7843  df-enr 8099  df-nr 8100  df-ltr 8103

This theorem is used by:  axpre-apti  8258