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

Theorem aptisr 7387
Description: Apartness of signed reals is tight. (Contributed by Jim Kingdon, 29-Jan-2020.)
Assertion
Ref Expression
aptisr ((𝐴R𝐵R ∧ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)) → 𝐴 = 𝐵)

Proof of Theorem aptisr
Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nr 7336 . . 3 R = ((P × P) / ~R )
2 breq1 3856 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R [⟨𝑧, 𝑤⟩] ~R ))
3 breq2 3857 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ [⟨𝑧, 𝑤⟩] ~R <R 𝐴))
42, 3orbi12d 743 . . . . 5 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
54notbid 628 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
6 eqeq1 2095 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R𝐴 = [⟨𝑧, 𝑤⟩] ~R ))
75, 6imbi12d 233 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ((¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R )))
8 breq2 3857 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R 𝐵))
9 breq1 3856 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ([⟨𝑧, 𝑤⟩] ~R <R 𝐴𝐵 <R 𝐴))
108, 9orbi12d 743 . . . . 5 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ (𝐴 <R 𝐵𝐵 <R 𝐴)))
1110notbid 628 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)))
12 eqeq2 2098 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 = [⟨𝑧, 𝑤⟩] ~R𝐴 = 𝐵))
1311, 12imbi12d 233 . . 3 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵)))
14 addcomprg 7200 . . . . . . . . 9 ((𝑦P𝑧P) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
1514ad2ant2lr 495 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
16 addcomprg 7200 . . . . . . . . 9 ((𝑥P𝑤P) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1716ad2ant2rl 496 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1815, 17breq12d 3866 . . . . . . 7 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ((𝑦 +P 𝑧)<P (𝑥 +P 𝑤) ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
1918orbi2d 740 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
2019notbid 628 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
21 addclpr 7159 . . . . . . 7 ((𝑥P𝑤P) → (𝑥 +P 𝑤) ∈ P)
2221ad2ant2rl 496 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) ∈ P)
23 addclpr 7159 . . . . . . 7 ((𝑦P𝑧P) → (𝑦 +P 𝑧) ∈ P)
2423ad2ant2lr 495 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) ∈ P)
25 aptipr 7263 . . . . . . 7 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P ∧ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤))) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧))
26253expia 1146 . . . . . 6 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2722, 24, 26syl2anc 404 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2820, 27sylbird 169 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
29 ltsrprg 7356 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤)<P (𝑦 +P 𝑧)))
30 ltsrprg 7356 . . . . . . 7 (((𝑧P𝑤P) ∧ (𝑥P𝑦P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3130ancoms 265 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3229, 31orbi12d 743 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
3332notbid 628 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
34 enreceq 7345 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
3528, 33, 343imtr4d 202 . . 3 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ))
361, 7, 13, 352ecoptocl 6396 . 2 ((𝐴R𝐵R) → (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵))
37363impia 1141 1 ((𝐴R𝐵R ∧ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)) → 𝐴 = 𝐵)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 665  w3a 925   = wceq 1290  wcel 1439  cop 3455   class class class wbr 3853  (class class class)co 5668  [cec 6306  Pcnp 6913   +P cpp 6915  <P cltp 6917   ~R cer 6918  Rcnr 6919   <R cltr 6925
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3962  ax-sep 3965  ax-nul 3973  ax-pow 4017  ax-pr 4047  ax-un 4271  ax-setind 4368  ax-iinf 4418
This theorem depends on definitions:  df-bi 116  df-dc 782  df-3or 926  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2624  df-sbc 2844  df-csb 2937  df-dif 3004  df-un 3006  df-in 3008  df-ss 3015  df-nul 3290  df-pw 3437  df-sn 3458  df-pr 3459  df-op 3461  df-uni 3662  df-int 3697  df-iun 3740  df-br 3854  df-opab 3908  df-mpt 3909  df-tr 3945  df-eprel 4127  df-id 4131  df-po 4134  df-iso 4135  df-iord 4204  df-on 4206  df-suc 4209  df-iom 4421  df-xp 4460  df-rel 4461  df-cnv 4462  df-co 4463  df-dm 4464  df-rn 4465  df-res 4466  df-ima 4467  df-iota 4995  df-fun 5032  df-fn 5033  df-f 5034  df-f1 5035  df-fo 5036  df-f1o 5037  df-fv 5038  df-ov 5671  df-oprab 5672  df-mpt2 5673  df-1st 5927  df-2nd 5928  df-recs 6086  df-irdg 6151  df-1o 6197  df-2o 6198  df-oadd 6201  df-omul 6202  df-er 6308  df-ec 6310  df-qs 6314  df-ni 6926  df-pli 6927  df-mi 6928  df-lti 6929  df-plpq 6966  df-mpq 6967  df-enq 6969  df-nqqs 6970  df-plqqs 6971  df-mqqs 6972  df-1nqqs 6973  df-rq 6974  df-ltnqqs 6975  df-enq0 7046  df-nq0 7047  df-0nq0 7048  df-plq0 7049  df-mq0 7050  df-inp 7088  df-iplp 7090  df-iltp 7092  df-enr 7335  df-nr 7336  df-ltr 7339
This theorem is referenced by:  axpre-apti  7483
  Copyright terms: Public domain W3C validator