| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > axpre-apti | GIF version | ||
| 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 8146.
(Contributed by Jim Kingdon, 29-Jan-2020.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axpre-apti | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴)) → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elreal 8047 | . . 3 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 2 | elreal 8047 | . . 3 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R 〈𝑦, 0R〉 = 𝐵) | |
| 3 | breq1 4091 | . . . . . 6 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 𝐴 <ℝ 〈𝑦, 0R〉)) | |
| 4 | breq2 4092 | . . . . . 6 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉 ↔ 〈𝑦, 0R〉 <ℝ 𝐴)) | |
| 5 | 3, 4 | orbi12d 800 | . . . . 5 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ (𝐴 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴))) |
| 6 | 5 | notbid 673 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → (¬ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ ¬ (𝐴 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴))) |
| 7 | eqeq1 2238 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ 𝐴 = 〈𝑦, 0R〉)) | |
| 8 | 6, 7 | imbi12d 234 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((¬ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) → 〈𝑥, 0R〉 = 〈𝑦, 0R〉) ↔ (¬ (𝐴 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴) → 𝐴 = 〈𝑦, 0R〉))) |
| 9 | breq2 4092 | . . . . . 6 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 <ℝ 〈𝑦, 0R〉 ↔ 𝐴 <ℝ 𝐵)) | |
| 10 | breq1 4091 | . . . . . 6 ⊢ (〈𝑦, 0R〉 = 𝐵 → (〈𝑦, 0R〉 <ℝ 𝐴 ↔ 𝐵 <ℝ 𝐴)) | |
| 11 | 9, 10 | orbi12d 800 | . . . . 5 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((𝐴 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴) ↔ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
| 12 | 11 | notbid 673 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → (¬ (𝐴 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴) ↔ ¬ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
| 13 | eqeq2 2241 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 = 〈𝑦, 0R〉 ↔ 𝐴 = 𝐵)) | |
| 14 | 12, 13 | imbi12d 234 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((¬ (𝐴 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴) → 𝐴 = 〈𝑦, 0R〉) ↔ (¬ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴) → 𝐴 = 𝐵))) |
| 15 | aptisr 7998 | . . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ ¬ (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥)) → 𝑥 = 𝑦) | |
| 16 | 15 | 3expia 1231 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (¬ (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥) → 𝑥 = 𝑦)) |
| 17 | ltresr 8058 | . . . . . 6 ⊢ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 𝑥 <R 𝑦) | |
| 18 | ltresr 8058 | . . . . . 6 ⊢ (〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉 ↔ 𝑦 <R 𝑥) | |
| 19 | 17, 18 | orbi12i 771 | . . . . 5 ⊢ ((〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥)) |
| 20 | 19 | notbii 674 | . . . 4 ⊢ (¬ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ ¬ (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥)) |
| 21 | vex 2805 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 22 | 21 | eqresr 8055 | . . . 4 ⊢ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ 𝑥 = 𝑦) |
| 23 | 16, 20, 22 | 3imtr4g 205 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (¬ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) → 〈𝑥, 0R〉 = 〈𝑦, 0R〉)) |
| 24 | 1, 2, 8, 14, 23 | 2gencl 2836 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (¬ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴) → 𝐴 = 𝐵)) |
| 25 | 24 | 3impia 1226 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴)) → 𝐴 = 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 715 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 〈cop 3672 class class class wbr 4088 Rcnr 7516 0Rc0r 7517 <R cltr 7522 ℝcr 8030 <ℝ cltrr 8035 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-eprel 4386 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-1o 6581 df-2o 6582 df-oadd 6585 df-omul 6586 df-er 6701 df-ec 6703 df-qs 6707 df-ni 7523 df-pli 7524 df-mi 7525 df-lti 7526 df-plpq 7563 df-mpq 7564 df-enq 7566 df-nqqs 7567 df-plqqs 7568 df-mqqs 7569 df-1nqqs 7570 df-rq 7571 df-ltnqqs 7572 df-enq0 7643 df-nq0 7644 df-0nq0 7645 df-plq0 7646 df-mq0 7647 df-inp 7685 df-i1p 7686 df-iplp 7687 df-iltp 7689 df-enr 7945 df-nr 7946 df-ltr 7949 df-0r 7950 df-r 8041 df-lt 8044 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |