| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lelttr | GIF version | ||
| Description: Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 23-May-1999.) |
| Ref | Expression |
|---|---|
| lelttr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprl 535 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → 𝐴 ≤ 𝐵) | |
| 2 | simpl1 1031 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → 𝐴 ∈ ℝ) | |
| 3 | simpl2 1032 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ℝ) | |
| 4 | lenlt 8407 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 5 | 2, 3, 4 | syl2anc 415 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
| 6 | 1, 5 | mpbid 147 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → ¬ 𝐵 < 𝐴) |
| 7 | 6 | pm2.21d 628 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → (𝐵 < 𝐴 → 𝐴 < 𝐶)) |
| 8 | idd 21 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → (𝐴 < 𝐶 → 𝐴 < 𝐶)) | |
| 9 | simprr 537 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 < 𝐶) | |
| 10 | simpl3 1033 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → 𝐶 ∈ ℝ) | |
| 11 | axltwlin 8399 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐶 → (𝐵 < 𝐴 ∨ 𝐴 < 𝐶))) | |
| 12 | 3, 10, 2, 11 | syl3anc 1278 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → (𝐵 < 𝐶 → (𝐵 < 𝐴 ∨ 𝐴 < 𝐶))) |
| 13 | 9, 12 | mpd 13 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → (𝐵 < 𝐴 ∨ 𝐴 < 𝐶)) |
| 14 | 7, 8, 13 | mpjaod 730 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶)) → 𝐴 < 𝐶) |
| 15 | 14 | ex 115 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 ∧ w3a 1009 ∈ wcel 2209 class class class wbr 4131 ℝcr 8184 < clt 8366 ≤ cle 8367 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-pre-ltwlin 8298 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4132 df-opab 4194 df-xp 4782 df-cnv 4784 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 |
| This theorem is used by: lelttri 8438 lelttrd 8458 letrp1 9186 ltmul12a 9198 bndndx 9573 uzind 9767 fnn0ind 9772 nn0p1elfzo 10610 elfzo0z 10612 fzofzim 10616 elfzodifsumelfzo 10635 flqge 10735 flapge 10736 modfzo0difsn 10852 expnlbnd2 11123 ccat2s1fvwd 11436 swrdswrd 11498 pfxccatin12lem3 11525 caubnd2 11905 mulcn2 12102 cn1lem 12104 climsqz 12125 climsqz2 12126 climcvg1nlem 12139 ltoddhalfle 12684 algcvgblem 12851 pclemub 13094 metss2lem 15740 logdivlti 16128 chtqub 16313 bposlem6 16333 gausslemma2dlem2 16403 lealltlt2 16974 |
| Copyright terms: Public domain | W3C validator |