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

Theorem aptisr 6920
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 6869 . . 3 R = ((P × P) / ~R )
2 breq1 3794 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R [⟨𝑧, 𝑤⟩] ~R ))
3 breq2 3795 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ [⟨𝑧, 𝑤⟩] ~R <R 𝐴))
42, 3orbi12d 717 . . . . 5 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
54notbid 602 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
6 eqeq1 2062 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R𝐴 = [⟨𝑧, 𝑤⟩] ~R ))
75, 6imbi12d 227 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ((¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R )))
8 breq2 3795 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R 𝐵))
9 breq1 3794 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ([⟨𝑧, 𝑤⟩] ~R <R 𝐴𝐵 <R 𝐴))
108, 9orbi12d 717 . . . . 5 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ (𝐴 <R 𝐵𝐵 <R 𝐴)))
1110notbid 602 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)))
12 eqeq2 2065 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 = [⟨𝑧, 𝑤⟩] ~R𝐴 = 𝐵))
1311, 12imbi12d 227 . . 3 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵)))
14 addcomprg 6733 . . . . . . . . 9 ((𝑦P𝑧P) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
1514ad2ant2lr 487 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
16 addcomprg 6733 . . . . . . . . 9 ((𝑥P𝑤P) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1716ad2ant2rl 488 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1815, 17breq12d 3804 . . . . . . 7 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ((𝑦 +P 𝑧)<P (𝑥 +P 𝑤) ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
1918orbi2d 714 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
2019notbid 602 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
21 addclpr 6692 . . . . . . 7 ((𝑥P𝑤P) → (𝑥 +P 𝑤) ∈ P)
2221ad2ant2rl 488 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) ∈ P)
23 addclpr 6692 . . . . . . 7 ((𝑦P𝑧P) → (𝑦 +P 𝑧) ∈ P)
2423ad2ant2lr 487 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) ∈ P)
25 aptipr 6796 . . . . . . 7 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P ∧ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤))) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧))
26253expia 1117 . . . . . 6 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2722, 24, 26syl2anc 397 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2820, 27sylbird 163 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
29 ltsrprg 6889 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤)<P (𝑦 +P 𝑧)))
30 ltsrprg 6889 . . . . . . 7 (((𝑧P𝑤P) ∧ (𝑥P𝑦P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3130ancoms 259 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3229, 31orbi12d 717 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
3332notbid 602 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
34 enreceq 6878 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
3528, 33, 343imtr4d 196 . . 3 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ))
361, 7, 13, 352ecoptocl 6224 . 2 ((𝐴R𝐵R) → (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵))
37363impia 1112 1 ((𝐴R𝐵R ∧ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)) → 𝐴 = 𝐵)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 101  wb 102  wo 639  w3a 896   = wceq 1259  wcel 1409  cop 3405   class class class wbr 3791  (class class class)co 5539  [cec 6134  Pcnp 6446   +P cpp 6448  <P cltp 6450   ~R cer 6451  Rcnr 6452   <R cltr 6458
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-nul 3910  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-iinf 4338
This theorem depends on definitions:  df-bi 114  df-dc 754  df-3or 897  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-int 3643  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-tr 3882  df-eprel 4053  df-id 4057  df-po 4060  df-iso 4061  df-iord 4130  df-on 4132  df-suc 4135  df-iom 4341  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-ov 5542  df-oprab 5543  df-mpt2 5544  df-1st 5794  df-2nd 5795  df-recs 5950  df-irdg 5987  df-1o 6031  df-2o 6032  df-oadd 6035  df-omul 6036  df-er 6136  df-ec 6138  df-qs 6142  df-ni 6459  df-pli 6460  df-mi 6461  df-lti 6462  df-plpq 6499  df-mpq 6500  df-enq 6502  df-nqqs 6503  df-plqqs 6504  df-mqqs 6505  df-1nqqs 6506  df-rq 6507  df-ltnqqs 6508  df-enq0 6579  df-nq0 6580  df-0nq0 6581  df-plq0 6582  df-mq0 6583  df-inp 6621  df-iplp 6623  df-iltp 6625  df-enr 6868  df-nr 6869  df-ltr 6872
This theorem is referenced by:  axpre-apti  7016
  Copyright terms: Public domain W3C validator