![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wrdlenge2n0 | Structured version Visualization version 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 10364 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → 1 ∈ ℝ) | |
2 | 2re 11432 | . . . . . 6 ⊢ 2 ∈ ℝ | |
3 | 2 | a1i 11 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → 2 ∈ ℝ) |
4 | lencl 13600 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
5 | 4 | nn0red 11686 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℝ) |
6 | 1, 3, 5 | 3jca 1162 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ)) |
7 | 6 | adantr 474 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ)) |
8 | simpr 479 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ≤ (♯‘𝑊)) | |
9 | 1lt2 11536 | . . . 4 ⊢ 1 < 2 | |
10 | 8, 9 | jctil 515 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (1 < 2 ∧ 2 ≤ (♯‘𝑊))) |
11 | ltleletr 10456 | . . 3 ⊢ ((1 ∈ ℝ ∧ 2 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ) → ((1 < 2 ∧ 2 ≤ (♯‘𝑊)) → 1 ≤ (♯‘𝑊))) | |
12 | 7, 10, 11 | sylc 65 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 1 ≤ (♯‘𝑊)) |
13 | wrdlenge1n0 13617 | . . 3 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ≠ ∅ ↔ 1 ≤ (♯‘𝑊))) | |
14 | 13 | adantr 474 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (𝑊 ≠ ∅ ↔ 1 ≤ (♯‘𝑊))) |
15 | 12, 14 | mpbird 249 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 𝑊 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 ∧ w3a 1111 ∈ wcel 2164 ≠ wne 2999 ∅c0 4146 class class class wbr 4875 ‘cfv 6127 ℝcr 10258 1c1 10260 < clt 10398 ≤ cle 10399 2c2 11413 ♯chash 13417 Word cword 13581 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4996 ax-sep 5007 ax-nul 5015 ax-pow 5067 ax-pr 5129 ax-un 7214 ax-cnex 10315 ax-resscn 10316 ax-1cn 10317 ax-icn 10318 ax-addcl 10319 ax-addrcl 10320 ax-mulcl 10321 ax-mulrcl 10322 ax-mulcom 10323 ax-addass 10324 ax-mulass 10325 ax-distr 10326 ax-i2m1 10327 ax-1ne0 10328 ax-1rid 10329 ax-rnegex 10330 ax-rrecex 10331 ax-cnre 10332 ax-pre-lttri 10333 ax-pre-lttrn 10334 ax-pre-ltadd 10335 ax-pre-mulgt0 10336 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3or 1112 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4147 df-if 4309 df-pw 4382 df-sn 4400 df-pr 4402 df-tp 4404 df-op 4406 df-uni 4661 df-int 4700 df-iun 4744 df-br 4876 df-opab 4938 df-mpt 4955 df-tr 4978 df-id 5252 df-eprel 5257 df-po 5265 df-so 5266 df-fr 5305 df-we 5307 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-rn 5357 df-res 5358 df-ima 5359 df-pred 5924 df-ord 5970 df-on 5971 df-lim 5972 df-suc 5973 df-iota 6090 df-fun 6129 df-fn 6130 df-f 6131 df-f1 6132 df-fo 6133 df-f1o 6134 df-fv 6135 df-riota 6871 df-ov 6913 df-oprab 6914 df-mpt2 6915 df-om 7332 df-1st 7433 df-2nd 7434 df-wrecs 7677 df-recs 7739 df-rdg 7777 df-1o 7831 df-oadd 7835 df-er 8014 df-en 8229 df-dom 8230 df-sdom 8231 df-fin 8232 df-card 9085 df-pnf 10400 df-mnf 10401 df-xr 10402 df-ltxr 10403 df-le 10404 df-sub 10594 df-neg 10595 df-nn 11358 df-2 11421 df-n0 11626 df-xnn0 11698 df-z 11712 df-uz 11976 df-fz 12627 df-fzo 12768 df-hash 13418 df-word 13582 |
This theorem is referenced by: swrdtrcfv0OLD 13738 pfxtrcfv0 13780 clwlkclwwlk 27338 clwlkclwwlkOLD 27339 |
Copyright terms: Public domain | W3C validator |