![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ltne | GIF version |
Description: 'Less than' implies not equal. See also ltap 8585 which is the same but for apartness. (Contributed by NM, 9-Oct-1999.) (Revised by Mario Carneiro, 16-Sep-2015.) |
Ref | Expression |
---|---|
ltne | ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 𝐵) → 𝐵 ≠ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltnr 8029 | . . . 4 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴) | |
2 | breq2 4006 | . . . . 5 ⊢ (𝐵 = 𝐴 → (𝐴 < 𝐵 ↔ 𝐴 < 𝐴)) | |
3 | 2 | notbid 667 | . . . 4 ⊢ (𝐵 = 𝐴 → (¬ 𝐴 < 𝐵 ↔ ¬ 𝐴 < 𝐴)) |
4 | 1, 3 | syl5ibrcom 157 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐵 = 𝐴 → ¬ 𝐴 < 𝐵)) |
5 | 4 | necon2ad 2404 | . 2 ⊢ (𝐴 ∈ ℝ → (𝐴 < 𝐵 → 𝐵 ≠ 𝐴)) |
6 | 5 | imp 124 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 𝐵) → 𝐵 ≠ 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 ≠ wne 2347 class class class wbr 4002 ℝcr 7806 < clt 7987 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4120 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-setind 4535 ax-cnex 7898 ax-resscn 7899 ax-pre-ltirr 7919 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2739 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-br 4003 df-opab 4064 df-xp 4631 df-pnf 7989 df-mnf 7990 df-ltxr 7992 |
This theorem is referenced by: gtneii 8048 ltnei 8056 gtned 8065 gt0ne0 8379 lt0ne0 8380 gt0ne0d 8464 nngt1ne1 8949 zdceq 9323 qdceq 10241 coprm 12135 phibndlem 12207 tridceq 14655 |
Copyright terms: Public domain | W3C validator |