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

Theorem aptisr 8152
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 8100 . . 3 R = ((P × P) / ~R )
2 breq1 4134 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ↔ 𝐴 <R [⟨𝑧, 𝑤⟩] ~R ))
3 breq2 4135 . . . . . 6 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ↔ [⟨𝑧, 𝑤⟩] ~R <R 𝐴))
42, 3orbi12d 805 . . . . 5 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
54notbid 677 . . . 4 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴)))
6 eqeq1 2245 . . . 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 4135 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ↔ 𝐴 <R 𝐵))
9 breq1 4134 . . . . . 6 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ([⟨𝑧, 𝑤⟩] ~R <R 𝐴 ↔ 𝐵 <R 𝐴))
108, 9orbi12d 805 . . . . 5 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ (𝐴 <R 𝐵 ∨ 𝐵 <R 𝐴)))
1110notbid 677 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) ↔ ¬ (𝐴 <R 𝐵 ∨ 𝐵 <R 𝐴)))
12 eqeq2 2248 . . . 4 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → (𝐴 = [⟨𝑧, 𝑤⟩] ~R ↔ 𝐴 = 𝐵))
1311, 12imbi12d 234 . . 3 ([⟨𝑧, 𝑤⟩] ~R = 𝐵 → ((¬ (𝐴 <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R 𝐴) → 𝐴 = [⟨𝑧, 𝑤⟩] ~R ) ↔ (¬ (𝐴 <R 𝐵 ∨ 𝐵 <R 𝐴) → 𝐴 = 𝐵)))
14 addcomprg 7951 . . . . . . . . 9 ((𝑦 ∈ P ∧ 𝑧 ∈ P) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
1514ad2ant2lr 514 . . . . . . . 8 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (𝑦 +P 𝑧) = (𝑧 +P 𝑦))
16 addcomprg 7951 . . . . . . . . 9 ((𝑥 ∈ P ∧ 𝑤 ∈ P) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1716ad2ant2rl 515 . . . . . . . 8 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (𝑥 +P 𝑤) = (𝑤 +P 𝑥))
1815, 17breq12d 4144 . . . . . . 7 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → ((𝑦 +P 𝑧)<P (𝑥 +P 𝑤) ↔ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥)))
1918orbi2d 802 . . . . . 6 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
2019notbid 677 . . . . 5 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
21 addclpr 7910 . . . . . . 7 ((𝑥 ∈ P ∧ 𝑤 ∈ P) → (𝑥 +P 𝑤) ∈ P)
2221ad2ant2rl 515 . . . . . 6 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (𝑥 +P 𝑤) ∈ P)
23 addclpr 7910 . . . . . . 7 ((𝑦 ∈ P ∧ 𝑧 ∈ P) → (𝑦 +P 𝑧) ∈ P)
2423ad2ant2lr 514 . . . . . 6 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (𝑦 +P 𝑧) ∈ P)
25 aptipr 8014 . . . . . . 7 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P ∧ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤))) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧))
26253expia 1236 . . . . . 6 (((𝑥 +P 𝑤) ∈ P ∧ (𝑦 +P 𝑧) ∈ P) → (¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑦 +P 𝑧)<P (𝑥 +P 𝑤)) → (𝑥 +P 𝑤) = (𝑦 +P 𝑧)))
2722, 24, 26syl2anc 415 . . . . 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 8120 . . . . . 6 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ↔ (𝑥 +P 𝑤)<P (𝑦 +P 𝑧)))
30 ltsrprg 8120 . . . . . . 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 805 . . . . 5 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
3332notbid 677 . . . 4 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (𝑧 ∈ P ∧ 𝑤 ∈ P)) → (¬ ([⟨𝑥, 𝑦⟩] ~R <R [⟨𝑧, 𝑤⟩] ~R ∨ [⟨𝑧, 𝑤⟩] ~R <R [⟨𝑥, 𝑦⟩] ~R ) ↔ ¬ ((𝑥 +P 𝑤)<P (𝑦 +P 𝑧) ∨ (𝑧 +P 𝑦)<P (𝑤 +P 𝑥))))
34 enreceq 8109 . . . 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 6901 . 2 ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (¬ (𝐴 <R 𝐵 ∨ 𝐵 <R 𝐴) → 𝐴 = 𝐵))
37363impia 1231 1 ((𝐴 ∈ R ∧ 𝐵 ∈ R ∧ ¬ (𝐴 <R 𝐵 ∨ 𝐵 <R 𝐴)) → 𝐴 = 𝐵)
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ⟨cop 3712   class class class wbr 4131  (class class class)co 6088  [cec 6809  Pcnp 7664   +P cpp 7666  <P cltp 7668   ~R cer 7669  Rcnr 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
  Copyright terms: Public domain W3C validator