![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > qdclt | GIF version |
Description: Rational < is decidable. (Contributed by Jim Kingdon, 7-Aug-2025.) |
Ref | Expression |
---|---|
qdclt | ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → DECID 𝐴 < 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | qtri3or 10316 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴)) | |
2 | qre 9696 | . . 3 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
3 | qre 9696 | . . 3 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℝ) | |
4 | orc 713 | . . . . . 6 ⊢ (𝐴 < 𝐵 → (𝐴 < 𝐵 ∨ ¬ 𝐴 < 𝐵)) | |
5 | df-dc 836 | . . . . . 6 ⊢ (DECID 𝐴 < 𝐵 ↔ (𝐴 < 𝐵 ∨ ¬ 𝐴 < 𝐵)) | |
6 | 4, 5 | sylibr 134 | . . . . 5 ⊢ (𝐴 < 𝐵 → DECID 𝐴 < 𝐵) |
7 | 6 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → DECID 𝐴 < 𝐵)) |
8 | ltnr 8101 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴) | |
9 | 8 | adantr 276 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 = 𝐵) → ¬ 𝐴 < 𝐴) |
10 | breq2 4037 | . . . . . . . . 9 ⊢ (𝐴 = 𝐵 → (𝐴 < 𝐴 ↔ 𝐴 < 𝐵)) | |
11 | 10 | adantl 277 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 = 𝐵) → (𝐴 < 𝐴 ↔ 𝐴 < 𝐵)) |
12 | 9, 11 | mtbid 673 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 = 𝐵) → ¬ 𝐴 < 𝐵) |
13 | olc 712 | . . . . . . . 8 ⊢ (¬ 𝐴 < 𝐵 → (𝐴 < 𝐵 ∨ ¬ 𝐴 < 𝐵)) | |
14 | 13, 5 | sylibr 134 | . . . . . . 7 ⊢ (¬ 𝐴 < 𝐵 → DECID 𝐴 < 𝐵) |
15 | 12, 14 | syl 14 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 = 𝐵) → DECID 𝐴 < 𝐵) |
16 | 15 | ex 115 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 = 𝐵 → DECID 𝐴 < 𝐵)) |
17 | 16 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 → DECID 𝐴 < 𝐵)) |
18 | ltnsym 8110 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 → ¬ 𝐴 < 𝐵)) | |
19 | 18 | ancoms 268 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 → ¬ 𝐴 < 𝐵)) |
20 | 19, 14 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 → DECID 𝐴 < 𝐵)) |
21 | 7, 17, 20 | 3jaod 1315 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → DECID 𝐴 < 𝐵)) |
22 | 2, 3, 21 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → DECID 𝐴 < 𝐵)) |
23 | 1, 22 | mpd 13 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → DECID 𝐴 < 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 ∨ w3o 979 = wceq 1364 ∈ wcel 2167 class class class wbr 4033 ℝcr 7876 < clt 8059 ℚcq 9690 |
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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-cnex 7968 ax-resscn 7969 ax-1cn 7970 ax-1re 7971 ax-icn 7972 ax-addcl 7973 ax-addrcl 7974 ax-mulcl 7975 ax-mulrcl 7976 ax-addcom 7977 ax-mulcom 7978 ax-addass 7979 ax-mulass 7980 ax-distr 7981 ax-i2m1 7982 ax-0lt1 7983 ax-1rid 7984 ax-0id 7985 ax-rnegex 7986 ax-precex 7987 ax-cnre 7988 ax-pre-ltirr 7989 ax-pre-ltwlin 7990 ax-pre-lttrn 7991 ax-pre-apti 7992 ax-pre-ltadd 7993 ax-pre-mulgt0 7994 ax-pre-mulext 7995 |
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 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-br 4034 df-opab 4095 df-mpt 4096 df-id 4328 df-po 4331 df-iso 4332 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-1st 6198 df-2nd 6199 df-pnf 8061 df-mnf 8062 df-xr 8063 df-ltxr 8064 df-le 8065 df-sub 8197 df-neg 8198 df-reap 8599 df-ap 8606 df-div 8697 df-inn 8988 df-n0 9247 df-z 9324 df-q 9691 df-rp 9726 |
This theorem is referenced by: gausslemma2dlem1a 15266 gausslemma2dlem1cl 15267 gausslemma2dlem1f1o 15268 gausslemma2dlem4 15272 |
Copyright terms: Public domain | W3C validator |