| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltletr | GIF version | ||
| Description: Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 25-Aug-1999.) |
| Ref | Expression |
|---|---|
| ltletr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprr 533 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐵 ≤ 𝐶) | |
| 2 | simpl2 1027 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐵 ∈ ℝ) | |
| 3 | simpl3 1028 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐶 ∈ ℝ) | |
| 4 | lenlt 8254 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) | |
| 5 | 2, 3, 4 | syl2anc 411 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) |
| 6 | 1, 5 | mpbid 147 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → ¬ 𝐶 < 𝐵) |
| 7 | simprl 531 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐴 < 𝐵) | |
| 8 | axltwlin 8246 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵))) | |
| 9 | 8 | adantr 276 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐴 < 𝐵 → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵))) |
| 10 | 7, 9 | mpd 13 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵)) |
| 11 | 6, 10 | ecased 1385 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐴 < 𝐶) |
| 12 | 11 | ex 115 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 ∧ w3a 1004 ∈ wcel 2202 class class class wbr 4088 ℝcr 8030 < clt 8213 ≤ cle 8214 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-pre-ltwlin 8144 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-xp 4731 df-cnv 4733 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 |
| This theorem is referenced by: ltletri 8285 ltletrd 8602 ltleadd 8625 nngt0 9167 nnrecgt0 9180 elnnnn0c 9446 elnnz1 9501 zltp1le 9533 uz3m2nn 9806 ledivge1le 9960 addlelt 10002 zltaddlt1le 10241 elfz1b 10324 elfzodifsumelfzo 10445 ssfzo12bi 10469 swrdswrd 11285 swrdccatin1 11305 cos01gt0 12323 oddge22np1 12441 nn0seqcvgd 12612 coprm 12715 logdivlti 15604 gausslemma2dlem1a 15786 |
| Copyright terms: Public domain | W3C validator |