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

Theorem aptisr 7245
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 7194 . . 3 R = ((P × P) / ~R )
2 breq1 3817 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R [⟨𝑧, 𝑤⟩] ~R ))
3 breq2 3818 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ [⟨𝑧, 𝑤⟩] ~R <R 𝐴))
42, 3orbi12d 740 . . . . 5 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
54notbid 625 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
6 eqeq1 2091 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R𝐴 = [⟨𝑧, 𝑤⟩] ~R ))
75, 6imbi12d 232 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ((¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R )))
8 breq2 3818 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R 𝐵))
9 breq1 3817 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ([⟨𝑧, 𝑤⟩] ~R <R 𝐴𝐵 <R 𝐴))
108, 9orbi12d 740 . . . . 5 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ (𝐴 <R 𝐵𝐵 <R 𝐴)))
1110notbid 625 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)))
12 eqeq2 2094 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 = [⟨𝑧, 𝑤⟩] ~R𝐴 = 𝐵))
1311, 12imbi12d 232 . . 3 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵)))
14 addcomprg 7058 . . . . . . . . 9 ((𝑦P𝑧P) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
1514ad2ant2lr 494 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
16 addcomprg 7058 . . . . . . . . 9 ((𝑥P𝑤P) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1716ad2ant2rl 495 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1815, 17breq12d 3827 . . . . . . 7 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ((𝑦 +P 𝑧)<P (𝑥 +P 𝑤) ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
1918orbi2d 737 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
2019notbid 625 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
21 addclpr 7017 . . . . . . 7 ((𝑥P𝑤P) → (𝑥 +P 𝑤) ∈ P)
2221ad2ant2rl 495 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) ∈ P)
23 addclpr 7017 . . . . . . 7 ((𝑦P𝑧P) → (𝑦 +P 𝑧) ∈ P)
2423ad2ant2lr 494 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) ∈ P)
25 aptipr 7121 . . . . . . 7 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P ∧ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤))) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧))
26253expia 1143 . . . . . 6 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2722, 24, 26syl2anc 403 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2820, 27sylbird 168 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
29 ltsrprg 7214 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤)<P (𝑦 +P 𝑧)))
30 ltsrprg 7214 . . . . . . 7 (((𝑧P𝑤P) ∧ (𝑥P𝑦P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3130ancoms 264 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3229, 31orbi12d 740 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
3332notbid 625 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
34 enreceq 7203 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
3528, 33, 343imtr4d 201 . . 3 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ))
361, 7, 13, 352ecoptocl 6313 . 2 ((𝐴R𝐵R) → (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵))
37363impia 1138 1 ((𝐴R𝐵R ∧ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)) → 𝐴 = 𝐵)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103  wo 662  w3a 922   = wceq 1287  wcel 1436  cop 3428   class class class wbr 3814  (class class class)co 5594  [cec 6223  Pcnp 6771   +P cpp 6773  <P cltp 6775   ~R cer 6776  Rcnr 6777   <R cltr 6783
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-13 1447  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-coll 3922  ax-sep 3925  ax-nul 3933  ax-pow 3977  ax-pr 4003  ax-un 4227  ax-setind 4319  ax-iinf 4369
This theorem depends on definitions:  df-bi 115  df-dc 779  df-3or 923  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ne 2252  df-ral 2360  df-rex 2361  df-reu 2362  df-rab 2364  df-v 2616  df-sbc 2829  df-csb 2922  df-dif 2988  df-un 2990  df-in 2992  df-ss 2999  df-nul 3273  df-pw 3411  df-sn 3431  df-pr 3432  df-op 3434  df-uni 3631  df-int 3666  df-iun 3709  df-br 3815  df-opab 3869  df-mpt 3870  df-tr 3905  df-eprel 4083  df-id 4087  df-po 4090  df-iso 4091  df-iord 4160  df-on 4162  df-suc 4165  df-iom 4372  df-xp 4410  df-rel 4411  df-cnv 4412  df-co 4413  df-dm 4414  df-rn 4415  df-res 4416  df-ima 4417  df-iota 4937  df-fun 4974  df-fn 4975  df-f 4976  df-f1 4977  df-fo 4978  df-f1o 4979  df-fv 4980  df-ov 5597  df-oprab 5598  df-mpt2 5599  df-1st 5849  df-2nd 5850  df-recs 6005  df-irdg 6070  df-1o 6116  df-2o 6117  df-oadd 6120  df-omul 6121  df-er 6225  df-ec 6227  df-qs 6231  df-ni 6784  df-pli 6785  df-mi 6786  df-lti 6787  df-plpq 6824  df-mpq 6825  df-enq 6827  df-nqqs 6828  df-plqqs 6829  df-mqqs 6830  df-1nqqs 6831  df-rq 6832  df-ltnqqs 6833  df-enq0 6904  df-nq0 6905  df-0nq0 6906  df-plq0 6907  df-mq0 6908  df-inp 6946  df-iplp 6948  df-iltp 6950  df-enr 7193  df-nr 7194  df-ltr 7197
This theorem is referenced by:  axpre-apti  7341
  Copyright terms: Public domain W3C validator