| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qltnle | GIF version | ||
| Description: 'Less than' expressed in terms of 'less than or equal to'. (Contributed by Jim Kingdon, 8-Oct-2021.) |
| Ref | Expression |
|---|---|
| qltnle | ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qre 9699 | . . . . 5 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℝ) | |
| 2 | qre 9699 | . . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
| 3 | lenlt 8102 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ ¬ 𝐴 < 𝐵)) | |
| 4 | 1, 2, 3 | syl2anr 290 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐵 ≤ 𝐴 ↔ ¬ 𝐴 < 𝐵)) |
| 5 | 4 | biimpd 144 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐵 ≤ 𝐴 → ¬ 𝐴 < 𝐵)) |
| 6 | 5 | con2d 625 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 → ¬ 𝐵 ≤ 𝐴)) |
| 7 | qtri3or 10330 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴)) | |
| 8 | ax-1 6 | . . . . 5 ⊢ (𝐴 < 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
| 10 | eqcom 2198 | . . . . . . . . 9 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴) | |
| 11 | eqle 8118 | . . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐵 = 𝐴) → 𝐵 ≤ 𝐴) | |
| 12 | 10, 11 | sylan2b 287 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = 𝐵) → 𝐵 ≤ 𝐴) |
| 13 | 12 | ex 115 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
| 14 | 13 | adantl 277 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
| 15 | 1, 14 | sylan2 286 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 = 𝐵 → 𝐵 ≤ 𝐴)) |
| 16 | pm2.24 622 | . . . . 5 ⊢ (𝐵 ≤ 𝐴 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) | |
| 17 | 15, 16 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 = 𝐵 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
| 18 | ltle 8114 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 → 𝐵 ≤ 𝐴)) | |
| 19 | 1, 2, 18 | syl2anr 290 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐵 < 𝐴 → 𝐵 ≤ 𝐴)) |
| 20 | 19, 16 | syl6 33 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐵 < 𝐴 → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
| 21 | 9, 17, 20 | 3jaod 1315 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵))) |
| 22 | 7, 21 | mpd 13 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (¬ 𝐵 ≤ 𝐴 → 𝐴 < 𝐵)) |
| 23 | 6, 22 | impbid 129 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ w3o 979 = wceq 1364 ∈ wcel 2167 class class class wbr 4033 ℝcr 7878 < clt 8061 ≤ cle 8062 ℚcq 9693 |
| 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 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-mulrcl 7978 ax-addcom 7979 ax-mulcom 7980 ax-addass 7981 ax-mulass 7982 ax-distr 7983 ax-i2m1 7984 ax-0lt1 7985 ax-1rid 7986 ax-0id 7987 ax-rnegex 7988 ax-precex 7989 ax-cnre 7990 ax-pre-ltirr 7991 ax-pre-ltwlin 7992 ax-pre-lttrn 7993 ax-pre-apti 7994 ax-pre-ltadd 7995 ax-pre-mulgt0 7996 ax-pre-mulext 7997 |
| This theorem depends on definitions: df-bi 117 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 8063 df-mnf 8064 df-xr 8065 df-ltxr 8066 df-le 8067 df-sub 8199 df-neg 8200 df-reap 8602 df-ap 8609 df-div 8700 df-inn 8991 df-n0 9250 df-z 9327 df-q 9694 df-rp 9729 |
| This theorem is referenced by: xqltnle 10357 flqlt 10373 bitsfzo 12119 |
| Copyright terms: Public domain | W3C validator |