Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ltleap | GIF version |
Description: Less than in terms of non-strict order and apartness. (Contributed by Jim Kingdon, 28-Feb-2020.) |
Ref | Expression |
---|---|
ltleap | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltle 7994 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → 𝐴 ≤ 𝐵)) | |
2 | orc 707 | . . . 4 ⊢ (𝐴 < 𝐵 → (𝐴 < 𝐵 ∨ 𝐵 < 𝐴)) | |
3 | reaplt 8494 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 # 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) | |
4 | 2, 3 | syl5ibr 155 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → 𝐴 # 𝐵)) |
5 | 1, 4 | jcad 305 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵))) |
6 | simprl 526 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → 𝐴 ≤ 𝐵) | |
7 | lenlt 7982 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
8 | 7 | adantr 274 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
9 | 6, 8 | mpbid 146 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → ¬ 𝐵 < 𝐴) |
10 | simprr 527 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → 𝐴 # 𝐵) | |
11 | 3 | adantr 274 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → (𝐴 # 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
12 | 10, 11 | mpbid 146 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → (𝐴 < 𝐵 ∨ 𝐵 < 𝐴)) |
13 | 9, 12 | ecased 1344 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵)) → 𝐴 < 𝐵) |
14 | 13 | ex 114 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵) → 𝐴 < 𝐵)) |
15 | 5, 14 | impbid 128 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 703 ∈ wcel 2141 class class class wbr 3987 ℝcr 7760 < clt 7941 ≤ cle 7942 # cap 8487 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4105 ax-pow 4158 ax-pr 4192 ax-un 4416 ax-setind 4519 ax-cnex 7852 ax-resscn 7853 ax-1cn 7854 ax-1re 7855 ax-icn 7856 ax-addcl 7857 ax-addrcl 7858 ax-mulcl 7859 ax-mulrcl 7860 ax-addcom 7861 ax-mulcom 7862 ax-addass 7863 ax-mulass 7864 ax-distr 7865 ax-i2m1 7866 ax-0lt1 7867 ax-1rid 7868 ax-0id 7869 ax-rnegex 7870 ax-precex 7871 ax-cnre 7872 ax-pre-ltirr 7873 ax-pre-lttrn 7875 ax-pre-apti 7876 ax-pre-ltadd 7877 ax-pre-mulgt0 7878 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rab 2457 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-br 3988 df-opab 4049 df-id 4276 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-iota 5158 df-fun 5198 df-fv 5204 df-riota 5806 df-ov 5853 df-oprab 5854 df-mpo 5855 df-pnf 7943 df-mnf 7944 df-xr 7945 df-ltxr 7946 df-le 7947 df-sub 8079 df-neg 8080 df-reap 8481 df-ap 8488 |
This theorem is referenced by: recgt0 8753 prodgt0 8755 lt2msq 8789 zltlen 9277 qltlen 9586 egt2lt3 11729 |
Copyright terms: Public domain | W3C validator |