![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > swrdsb0eq | Structured version Visualization version GIF version |
Description: Two subwords with the same bounds are equal if the range is not valid. (Contributed by AV, 4-May-2020.) |
Ref | Expression |
---|---|
swrdsb0eq | ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr 〈𝑀, 𝑁〉) = (𝑈 substr 〈𝑀, 𝑁〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 766 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → 𝑊 ∈ Word 𝑉) | |
2 | nn0z 12483 | . . . . 5 ⊢ (𝑀 ∈ ℕ0 → 𝑀 ∈ ℤ) | |
3 | 2 | ad2antrl 727 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → 𝑀 ∈ ℤ) |
4 | nn0z 12483 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
5 | 4 | ad2antll 728 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → 𝑁 ∈ ℤ) |
6 | swrdlend 14499 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ≤ 𝑀 → (𝑊 substr 〈𝑀, 𝑁〉) = ∅)) | |
7 | 1, 3, 5, 6 | syl3anc 1372 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → (𝑁 ≤ 𝑀 → (𝑊 substr 〈𝑀, 𝑁〉) = ∅)) |
8 | 7 | 3impia 1118 | . 2 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr 〈𝑀, 𝑁〉) = ∅) |
9 | simplr 768 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → 𝑈 ∈ Word 𝑉) | |
10 | swrdlend 14499 | . . . 4 ⊢ ((𝑈 ∈ Word 𝑉 ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ≤ 𝑀 → (𝑈 substr 〈𝑀, 𝑁〉) = ∅)) | |
11 | 9, 3, 5, 10 | syl3anc 1372 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → (𝑁 ≤ 𝑀 → (𝑈 substr 〈𝑀, 𝑁〉) = ∅)) |
12 | 11 | 3impia 1118 | . 2 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) ∧ 𝑁 ≤ 𝑀) → (𝑈 substr 〈𝑀, 𝑁〉) = ∅) |
13 | 8, 12 | eqtr4d 2781 | 1 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr 〈𝑀, 𝑁〉) = (𝑈 substr 〈𝑀, 𝑁〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∅c0 4281 〈cop 4591 class class class wbr 5104 (class class class)co 7352 ≤ cle 11149 ℕ0cn0 12372 ℤcz 12458 Word cword 14356 substr csubstr 14486 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2709 ax-rep 5241 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7665 ax-cnex 11066 ax-resscn 11067 ax-1cn 11068 ax-icn 11069 ax-addcl 11070 ax-addrcl 11071 ax-mulcl 11072 ax-mulrcl 11073 ax-mulcom 11074 ax-addass 11075 ax-mulass 11076 ax-distr 11077 ax-i2m1 11078 ax-1ne0 11079 ax-1rid 11080 ax-rnegex 11081 ax-rrecex 11082 ax-cnre 11083 ax-pre-lttri 11084 ax-pre-lttrn 11085 ax-pre-ltadd 11086 ax-pre-mulgt0 11087 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-iun 4955 df-br 5105 df-opab 5167 df-mpt 5188 df-tr 5222 df-id 5530 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5587 df-we 5589 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6252 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7308 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7796 df-1st 7914 df-2nd 7915 df-frecs 8205 df-wrecs 8236 df-recs 8310 df-rdg 8349 df-er 8607 df-en 8843 df-dom 8844 df-sdom 8845 df-pnf 11150 df-mnf 11151 df-xr 11152 df-ltxr 11153 df-le 11154 df-sub 11346 df-neg 11347 df-nn 12113 df-n0 12373 df-z 12459 df-uz 12723 df-fz 13380 df-fzo 13523 df-substr 14487 |
This theorem is referenced by: swrdsbslen 14510 swrdspsleq 14511 |
Copyright terms: Public domain | W3C validator |