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 8355 | . . . . 5 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
2 | zre 8355 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
3 | lenlt 7187 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ ¬ 𝐴 < 𝐵)) | |
4 | 1, 2, 3 | syl2anr 284 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ ¬ 𝐴 < 𝐵)) |
5 | 4 | biimpd 142 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → ¬ 𝐴 < 𝐵)) |
6 | 5 | con2d 586 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → ¬ 𝐵 ≤ 𝐴)) |
7 | ztri3or 8394 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴)) | |
8 | ax-1 5 | . . . . 5 ⊢ (𝐴 < 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) | |
9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
10 | eqcom 2083 | . . . . . . . . 9 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴) | |
11 | eqle 7202 | . . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐵 = 𝐴) → 𝐵 ≤ 𝐴) | |
12 | 10, 11 | sylan2b 281 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = 𝐵) → 𝐵 ≤ 𝐴) |
13 | 12 | ex 113 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
14 | 13 | adantl 271 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
15 | 1, 14 | sylan2 280 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
16 | pm2.24 583 | . . . . 5 ⊢ (𝐵 ≤ 𝐴 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) | |
17 | 15, 16 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 = 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
18 | ltle 7198 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 → 𝐵 ≤ 𝐴)) | |
19 | 1, 2, 18 | syl2anr 284 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 < 𝐴 → 𝐵 ≤ 𝐴)) |
20 | 19, 16 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 < 𝐴 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
21 | 9, 17, 20 | 3jaod 1235 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
22 | 7, 21 | mpd 13 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) |
23 | 6, 22 | impbid 127 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 102 ↔ wb 103 ∨ w3o 918 = wceq 1284 ∈ wcel 1433 class class class wbr 3785 ℝcr 6980 < clt 7153 ≤ cle 7154 ℤcz 8351 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-addcom 7076 ax-addass 7078 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-0id 7084 ax-rnegex 7085 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-ltadd 7092 |
This theorem depends on definitions: df-bi 115 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-br 3786 df-opab 3840 df-id 4048 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-iota 4887 df-fun 4924 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-inn 8040 df-n0 8289 df-z 8352 |
This theorem is referenced by: znnnlt1 8399 nn0n0n1ge2b 8427 eluzdc 8697 fzdcel 9059 fzn 9061 fzpreddisj 9088 fzp1disj 9097 fzneuz 9118 fznuz 9119 uznfz 9120 fzp1nel 9121 difelfznle 9146 fzodisj 9187 exfzdc 9249 modfzo0difsn 9397 fzfig 9422 facdiv 9665 ibcval5 9690 alzdvds 10254 fzm1ndvds 10256 fzo0dvdseq 10257 n2dvds1 10312 dvdsbnd 10348 algcvgblem 10431 prmndvdsfaclt 10535 |
Copyright terms: Public domain | W3C validator |