Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > zltnle | GIF version |
Description: 'Less than' expressed in terms of 'less than or equal to'. (Contributed by Jim Kingdon, 14-Mar-2020.) |
Ref | Expression |
---|---|
zltnle | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zre 9058 | . . . . 5 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
2 | zre 9058 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
3 | lenlt 7840 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ ¬ 𝐴 < 𝐵)) | |
4 | 1, 2, 3 | syl2anr 288 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ ¬ 𝐴 < 𝐵)) |
5 | 4 | biimpd 143 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → ¬ 𝐴 < 𝐵)) |
6 | 5 | con2d 613 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → ¬ 𝐵 ≤ 𝐴)) |
7 | ztri3or 9097 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴)) | |
8 | ax-1 6 | . . . . 5 ⊢ (𝐴 < 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) | |
9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
10 | eqcom 2141 | . . . . . . . . 9 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴) | |
11 | eqle 7855 | . . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐵 = 𝐴) → 𝐵 ≤ 𝐴) | |
12 | 10, 11 | sylan2b 285 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = 𝐵) → 𝐵 ≤ 𝐴) |
13 | 12 | ex 114 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
14 | 13 | adantl 275 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
15 | 1, 14 | sylan2 284 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
16 | pm2.24 610 | . . . . 5 ⊢ (𝐵 ≤ 𝐴 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) | |
17 | 15, 16 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 = 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
18 | ltle 7851 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 → 𝐵 ≤ 𝐴)) | |
19 | 1, 2, 18 | syl2anr 288 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 < 𝐴 → 𝐵 ≤ 𝐴)) |
20 | 19, 16 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 < 𝐴 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
21 | 9, 17, 20 | 3jaod 1282 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
22 | 7, 21 | mpd 13 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) |
23 | 6, 22 | impbid 128 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ w3o 961 = wceq 1331 ∈ wcel 1480 class class class wbr 3929 ℝcr 7619 < clt 7800 ≤ cle 7801 ℤcz 9054 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-z 9055 |
This theorem is referenced by: znnnlt1 9102 nn0n0n1ge2b 9130 eluzdc 9404 fzdcel 9820 fzn 9822 fzpreddisj 9851 fzp1disj 9860 fzneuz 9881 fznuz 9882 uznfz 9883 fzp1nel 9884 difelfznle 9912 fzodisj 9955 exfzdc 10017 modfzo0difsn 10168 fzfig 10203 iseqf1olemqk 10267 exp3val 10295 facdiv 10484 bcval5 10509 zfz1isolemiso 10582 2zsupmax 10997 summodclem3 11149 alzdvds 11552 fzm1ndvds 11554 fzo0dvdseq 11555 n2dvds1 11609 dvdsbnd 11645 algcvgblem 11730 prmndvdsfaclt 11834 uzdcinzz 13005 |
Copyright terms: Public domain | W3C validator |