zdcle - Intuitionistic Logic Explorer

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

Theorem zdcle 9393

Description: Integer ≤ is decidable. (Contributed by Jim Kingdon, 7-Apr-2020.)

**Assertion**
Ref	Expression
zdcle	⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → DECID 𝐴 ≤ 𝐵)

**Proof of Theorem zdcle**
Step	Hyp	Ref	Expression
1		ztri3or 9360	. 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴))
2		zre 9321	. . 3 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ)
3		zre 9321	. . 3 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ)
4		ltle 8107	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → 𝐴 ≤ 𝐵))
5		orc 713	. . . . . 6 ⊢ (𝐴 ≤ 𝐵 → (𝐴 ≤ 𝐵 ∨ ¬ 𝐴 ≤ 𝐵))
6		df-dc 836	. . . . . 6 ⊢ (DECID 𝐴 ≤ 𝐵 ↔ (𝐴 ≤ 𝐵 ∨ ¬ 𝐴 ≤ 𝐵))
7	5, 6	sylibr 134	. . . . 5 ⊢ (𝐴 ≤ 𝐵 → DECID 𝐴 ≤ 𝐵)
8	4, 7	syl6 33	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → DECID 𝐴 ≤ 𝐵))
9		eqle 8111	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 = 𝐵) → 𝐴 ≤ 𝐵)
10	9, 7	syl 14	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 = 𝐵) → DECID 𝐴 ≤ 𝐵)
11	10	ex 115	. . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 = 𝐵 → DECID 𝐴 ≤ 𝐵))
12	11	adantr 276	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 → DECID 𝐴 ≤ 𝐵))
13		lenlt 8095	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴))
14	13	biimpd 144	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → ¬ 𝐵 < 𝐴))
15	14	con2d 625	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 → ¬ 𝐴 ≤ 𝐵))
16		olc 712	. . . . . 6 ⊢ (¬ 𝐴 ≤ 𝐵 → (𝐴 ≤ 𝐵 ∨ ¬ 𝐴 ≤ 𝐵))
17	16, 6	sylibr 134	. . . . 5 ⊢ (¬ 𝐴 ≤ 𝐵 → DECID 𝐴 ≤ 𝐵)
18	15, 17	syl6 33	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 → DECID 𝐴 ≤ 𝐵))
19	8, 12, 18	3jaod 1315	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → DECID 𝐴 ≤ 𝐵))
20	2, 3, 19	syl2an 289	. 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → DECID 𝐴 ≤ 𝐵))
21	1, 20	mpd 13	1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → DECID 𝐴 ≤ 𝐵)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 709 DECID wdc 835 ∨ w3o 979 = wceq 1364 ∈ wcel 2164 class class class wbr 4029 ℝcr 7871 < clt 8054 ≤ cle 8055 ℤcz 9317

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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-ltadd 7988

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 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-br 4030 df-opab 4091 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-iota 5215 df-fun 5256 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-inn 8983 df-n0 9241 df-z 9318

This theorem is referenced by: uzin 9625 xnn0dcle 9868 nelfzo 10218 exfzdc 10307 modfzo0difsn 10466 fzfig 10501 iseqf1olemjpcl 10579 iseqf1olemqpcl 10580 seq3f1oleml 10587 seq3f1o 10588 fser0const 10606 uzin2 11131 2zsupmax 11369 2zinfmin 11386 sumeq2 11502 summodclem2a 11524 fsum3 11530 fsumcl2lem 11541 fsumadd 11549 sumsnf 11552 fsummulc2 11591 explecnv 11648 prodeq2 11700 prodmodclem3 11718 prodmodclem2a 11719 fprodseq 11726 prod1dc 11729 fprodmul 11734 prodsnf 11735 infssuzex 12086 pcdvdsb 12458 pcmpt2 12482 pcmptdvds 12483 pcprod 12484 pcfac 12488 1arithlem4 12504 plyaddlem1 14893 plyaddlem 14895

W3C validator