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

Theorem axpre-apti 7969
Description: Apartness of reals is tight. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-apti 8011.

(Contributed by Jim Kingdon, 29-Jan-2020.) (New usage is discouraged.)

Assertion
Ref Expression
axpre-apti ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 < 𝐵𝐵 < 𝐴)) → 𝐴 = 𝐵)

Proof of Theorem axpre-apti
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elreal 7912 . . 3 (𝐴 ∈ ℝ ↔ ∃𝑥R𝑥, 0R⟩ = 𝐴)
2 elreal 7912 . . 3 (𝐵 ∈ ℝ ↔ ∃𝑦R𝑦, 0R⟩ = 𝐵)
3 breq1 4037 . . . . . 6 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ↔ 𝐴 <𝑦, 0R⟩))
4 breq2 4038 . . . . . 6 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑦, 0R⟩ <𝑥, 0R⟩ ↔ ⟨𝑦, 0R⟩ < 𝐴))
53, 4orbi12d 794 . . . . 5 (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴)))
65notbid 668 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (¬ (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ ¬ (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴)))
7 eqeq1 2203 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ 𝐴 = ⟨𝑦, 0R⟩))
86, 7imbi12d 234 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((¬ (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) → ⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩) ↔ (¬ (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴) → 𝐴 = ⟨𝑦, 0R⟩)))
9 breq2 4038 . . . . . 6 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <𝑦, 0R⟩ ↔ 𝐴 < 𝐵))
10 breq1 4037 . . . . . 6 (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ < 𝐴𝐵 < 𝐴))
119, 10orbi12d 794 . . . . 5 (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴) ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1211notbid 668 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (¬ (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴) ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
13 eqeq2 2206 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 = ⟨𝑦, 0R⟩ ↔ 𝐴 = 𝐵))
1412, 13imbi12d 234 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((¬ (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴) → 𝐴 = ⟨𝑦, 0R⟩) ↔ (¬ (𝐴 < 𝐵𝐵 < 𝐴) → 𝐴 = 𝐵)))
15 aptisr 7863 . . . . 5 ((𝑥R𝑦R ∧ ¬ (𝑥 <R 𝑦𝑦 <R 𝑥)) → 𝑥 = 𝑦)
16153expia 1207 . . . 4 ((𝑥R𝑦R) → (¬ (𝑥 <R 𝑦𝑦 <R 𝑥) → 𝑥 = 𝑦))
17 ltresr 7923 . . . . . 6 (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
18 ltresr 7923 . . . . . 6 (⟨𝑦, 0R⟩ <𝑥, 0R⟩ ↔ 𝑦 <R 𝑥)
1917, 18orbi12i 765 . . . . 5 ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ (𝑥 <R 𝑦𝑦 <R 𝑥))
2019notbii 669 . . . 4 (¬ (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ ¬ (𝑥 <R 𝑦𝑦 <R 𝑥))
21 vex 2766 . . . . 5 𝑥 ∈ V
2221eqresr 7920 . . . 4 (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ 𝑥 = 𝑦)
2316, 20, 223imtr4g 205 . . 3 ((𝑥R𝑦R) → (¬ (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) → ⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩))
241, 2, 8, 14, 232gencl 2796 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (¬ (𝐴 < 𝐵𝐵 < 𝐴) → 𝐴 = 𝐵))
25243impia 1202 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 < 𝐵𝐵 < 𝐴)) → 𝐴 = 𝐵)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 709  w3a 980   = wceq 1364  wcel 2167  cop 3626   class class class wbr 4034  Rcnr 7381  0Rc0r 7382   <R cltr 7387  cr 7895   < cltrr 7900
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-eprel 4325  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-irdg 6437  df-1o 6483  df-2o 6484  df-oadd 6487  df-omul 6488  df-er 6601  df-ec 6603  df-qs 6607  df-ni 7388  df-pli 7389  df-mi 7390  df-lti 7391  df-plpq 7428  df-mpq 7429  df-enq 7431  df-nqqs 7432  df-plqqs 7433  df-mqqs 7434  df-1nqqs 7435  df-rq 7436  df-ltnqqs 7437  df-enq0 7508  df-nq0 7509  df-0nq0 7510  df-plq0 7511  df-mq0 7512  df-inp 7550  df-i1p 7551  df-iplp 7552  df-iltp 7554  df-enr 7810  df-nr 7811  df-ltr 7814  df-0r 7815  df-r 7906  df-lt 7909
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator