| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > wrdlenge2n0 | GIF version | ||
| Description: A word with length at least 2 is not empty. (Contributed by AV, 18-Jun-2018.) (Proof shortened by AV, 14-Oct-2018.) |
| Ref | Expression |
|---|---|
| wrdlenge2n0 | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 𝑊 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1red 8196 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → 1 ∈ ℝ) | |
| 2 | 2re 9215 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 3 | 2 | a1i 9 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → 2 ∈ ℝ) |
| 4 | lencl 11123 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 5 | 4 | nn0red 9458 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℝ) |
| 6 | 1, 3, 5 | 3jca 1203 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ)) |
| 7 | 6 | adantr 276 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ)) |
| 8 | simpr 110 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ≤ (♯‘𝑊)) | |
| 9 | 1lt2 9315 | . . . 4 ⊢ 1 < 2 | |
| 10 | 8, 9 | jctil 312 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (1 < 2 ∧ 2 ≤ (♯‘𝑊))) |
| 11 | ltleletr 8263 | . . 3 ⊢ ((1 ∈ ℝ ∧ 2 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ) → ((1 < 2 ∧ 2 ≤ (♯‘𝑊)) → 1 ≤ (♯‘𝑊))) | |
| 12 | 7, 10, 11 | sylc 62 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 1 ≤ (♯‘𝑊)) |
| 13 | wrdlenge1n0 11153 | . . 3 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ≠ ∅ ↔ 1 ≤ (♯‘𝑊))) | |
| 14 | 13 | adantr 276 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (𝑊 ≠ ∅ ↔ 1 ≤ (♯‘𝑊))) |
| 15 | 12, 14 | mpbird 167 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 𝑊 ≠ ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 ∈ wcel 2201 ≠ wne 2401 ∅c0 3493 class class class wbr 4087 ‘cfv 5325 ℝcr 8033 1c1 8035 < clt 8216 ≤ cle 8217 2c2 9196 ♯chash 11040 Word cword 11119 |
| 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 2203 ax-14 2204 ax-ext 2212 ax-coll 4203 ax-sep 4206 ax-nul 4214 ax-pow 4263 ax-pr 4298 ax-un 4529 ax-setind 4634 ax-iinf 4685 ax-cnex 8125 ax-resscn 8126 ax-1cn 8127 ax-1re 8128 ax-icn 8129 ax-addcl 8130 ax-addrcl 8131 ax-mulcl 8132 ax-mulrcl 8133 ax-addcom 8134 ax-mulcom 8135 ax-addass 8136 ax-mulass 8137 ax-distr 8138 ax-i2m1 8139 ax-0lt1 8140 ax-1rid 8141 ax-0id 8142 ax-rnegex 8143 ax-precex 8144 ax-cnre 8145 ax-pre-ltirr 8146 ax-pre-ltwlin 8147 ax-pre-lttrn 8148 ax-pre-apti 8149 ax-pre-ltadd 8150 ax-pre-mulgt0 8151 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3653 df-sn 3674 df-pr 3675 df-op 3677 df-uni 3893 df-int 3928 df-iun 3971 df-br 4088 df-opab 4150 df-mpt 4151 df-tr 4187 df-id 4389 df-iord 4462 df-on 4464 df-ilim 4465 df-suc 4467 df-iom 4688 df-xp 4730 df-rel 4731 df-cnv 4732 df-co 4733 df-dm 4734 df-rn 4735 df-res 4736 df-ima 4737 df-iota 5285 df-fun 5327 df-fn 5328 df-f 5329 df-f1 5330 df-fo 5331 df-f1o 5332 df-fv 5333 df-riota 5973 df-ov 6023 df-oprab 6024 df-mpo 6025 df-1st 6305 df-2nd 6306 df-recs 6473 df-frec 6559 df-1o 6584 df-er 6704 df-en 6912 df-dom 6913 df-fin 6914 df-pnf 8218 df-mnf 8219 df-xr 8220 df-ltxr 8221 df-le 8222 df-sub 8354 df-neg 8355 df-reap 8757 df-ap 8764 df-inn 9146 df-2 9204 df-n0 9405 df-z 9482 df-uz 9758 df-fz 10246 df-fzo 10380 df-ihash 11041 df-word 11120 |
| This theorem is referenced by: pfxtrcfv0 11281 |
| Copyright terms: Public domain | W3C validator |