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

Theorem aptisr 7962
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 7910 . . 3 R = ((P × P) / ~R )
2 breq1 4085 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R [⟨𝑧, 𝑤⟩] ~R ))
3 breq2 4086 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ [⟨𝑧, 𝑤⟩] ~R <R 𝐴))
42, 3orbi12d 798 . . . . 5 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
54notbid 671 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
6 eqeq1 2236 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R𝐴 = [⟨𝑧, 𝑤⟩] ~R ))
75, 6imbi12d 234 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ((¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R )))
8 breq2 4086 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 <R [⟨𝑧, 𝑤⟩] ~R𝐴 <R 𝐵))
9 breq1 4085 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ([⟨𝑧, 𝑤⟩] ~R <R 𝐴𝐵 <R 𝐴))
108, 9orbi12d 798 . . . . 5 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ (𝐴 <R 𝐵𝐵 <R 𝐴)))
1110notbid 671 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)))
12 eqeq2 2239 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 = [⟨𝑧, 𝑤⟩] ~R𝐴 = 𝐵))
1311, 12imbi12d 234 . . 3 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵)))
14 addcomprg 7761 . . . . . . . . 9 ((𝑦P𝑧P) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
1514ad2ant2lr 510 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
16 addcomprg 7761 . . . . . . . . 9 ((𝑥P𝑤P) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1716ad2ant2rl 511 . . . . . . . 8 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1815, 17breq12d 4095 . . . . . . 7 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ((𝑦 +P 𝑧)<P (𝑥 +P 𝑤) ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
1918orbi2d 795 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
2019notbid 671 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
21 addclpr 7720 . . . . . . 7 ((𝑥P𝑤P) → (𝑥 +P 𝑤) ∈ P)
2221ad2ant2rl 511 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑥 +P 𝑤) ∈ P)
23 addclpr 7720 . . . . . . 7 ((𝑦P𝑧P) → (𝑦 +P 𝑧) ∈ P)
2423ad2ant2lr 510 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑦 +P 𝑧) ∈ P)
25 aptipr 7824 . . . . . . 7 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P ∧ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤))) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧))
26253expia 1229 . . . . . 6 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2722, 24, 26syl2anc 411 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2820, 27sylbird 170 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
29 ltsrprg 7930 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤)<P (𝑦 +P 𝑧)))
30 ltsrprg 7930 . . . . . . 7 (((𝑧P𝑤P) ∧ (𝑥P𝑦P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3130ancoms 268 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
3229, 31orbi12d 798 . . . . 5 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
3332notbid 671 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
34 enreceq 7919 . . . 4 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
3528, 33, 343imtr4d 203 . . 3 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) → [⟨𝑥, 𝑦⟩] ~R = [⟨𝑧, 𝑤⟩] ~R ))
361, 7, 13, 352ecoptocl 6768 . 2 ((𝐴R𝐵R) → (¬ (𝐴 <R 𝐵𝐵 <R 𝐴) → 𝐴 = 𝐵))
37363impia 1224 1 ((𝐴R𝐵R ∧ ¬ (𝐴 <R 𝐵𝐵 <R 𝐴)) → 𝐴 = 𝐵)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 713  w3a 1002   = wceq 1395  wcel 2200  cop 3669   class class class wbr 4082  (class class class)co 6000  [cec 6676  Pcnp 7474   +P cpp 7476  <P cltp 7478   ~R cer 7479  Rcnr 7480   <R cltr 7486
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-eprel 4379  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-irdg 6514  df-1o 6560  df-2o 6561  df-oadd 6564  df-omul 6565  df-er 6678  df-ec 6680  df-qs 6684  df-ni 7487  df-pli 7488  df-mi 7489  df-lti 7490  df-plpq 7527  df-mpq 7528  df-enq 7530  df-nqqs 7531  df-plqqs 7532  df-mqqs 7533  df-1nqqs 7534  df-rq 7535  df-ltnqqs 7536  df-enq0 7607  df-nq0 7608  df-0nq0 7609  df-plq0 7610  df-mq0 7611  df-inp 7649  df-iplp 7651  df-iltp 7653  df-enr 7909  df-nr 7910  df-ltr 7913
This theorem is referenced by:  axpre-apti  8068
  Copyright terms: Public domain W3C validator