Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pmtrdifwrdellem2 | Structured version Visualization version GIF version |
Description: Lemma 2 for pmtrdifwrdel 19103. (Contributed by AV, 15-Jan-2019.) |
Ref | Expression |
---|---|
pmtrdifel.t | ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) |
pmtrdifel.r | ⊢ 𝑅 = ran (pmTrsp‘𝑁) |
pmtrdifwrdel.0 | ⊢ 𝑈 = (𝑥 ∈ (0..^(♯‘𝑊)) ↦ ((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I ))) |
Ref | Expression |
---|---|
pmtrdifwrdellem2 | ⊢ (𝑊 ∈ Word 𝑇 → (♯‘𝑊) = (♯‘𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wrdsymbcl 14240 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑇 ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ 𝑇) | |
2 | pmtrdifel.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) | |
3 | pmtrdifel.r | . . . . . 6 ⊢ 𝑅 = ran (pmTrsp‘𝑁) | |
4 | eqid 2738 | . . . . . 6 ⊢ ((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I )) = ((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I )) | |
5 | 2, 3, 4 | pmtrdifellem1 19094 | . . . . 5 ⊢ ((𝑊‘𝑥) ∈ 𝑇 → ((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I )) ∈ 𝑅) |
6 | 1, 5 | syl 17 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑇 ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I )) ∈ 𝑅) |
7 | 6 | ralrimiva 3108 | . . 3 ⊢ (𝑊 ∈ Word 𝑇 → ∀𝑥 ∈ (0..^(♯‘𝑊))((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I )) ∈ 𝑅) |
8 | pmtrdifwrdel.0 | . . . 4 ⊢ 𝑈 = (𝑥 ∈ (0..^(♯‘𝑊)) ↦ ((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I ))) | |
9 | 8 | fnmpt 6565 | . . 3 ⊢ (∀𝑥 ∈ (0..^(♯‘𝑊))((pmTrsp‘𝑁)‘dom ((𝑊‘𝑥) ∖ I )) ∈ 𝑅 → 𝑈 Fn (0..^(♯‘𝑊))) |
10 | hashfn 14100 | . . 3 ⊢ (𝑈 Fn (0..^(♯‘𝑊)) → (♯‘𝑈) = (♯‘(0..^(♯‘𝑊)))) | |
11 | 7, 9, 10 | 3syl 18 | . 2 ⊢ (𝑊 ∈ Word 𝑇 → (♯‘𝑈) = (♯‘(0..^(♯‘𝑊)))) |
12 | lencl 14246 | . . 3 ⊢ (𝑊 ∈ Word 𝑇 → (♯‘𝑊) ∈ ℕ0) | |
13 | hashfzo0 14155 | . . 3 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘(0..^(♯‘𝑊))) = (♯‘𝑊)) | |
14 | 12, 13 | syl 17 | . 2 ⊢ (𝑊 ∈ Word 𝑇 → (♯‘(0..^(♯‘𝑊))) = (♯‘𝑊)) |
15 | 11, 14 | eqtr2d 2779 | 1 ⊢ (𝑊 ∈ Word 𝑇 → (♯‘𝑊) = (♯‘𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ∖ cdif 3883 {csn 4561 ↦ cmpt 5156 I cid 5483 dom cdm 5584 ran crn 5585 Fn wfn 6421 ‘cfv 6426 (class class class)co 7267 0cc0 10881 ℕ0cn0 12243 ..^cfzo 13392 ♯chash 14054 Word cword 14227 pmTrspcpmtr 19059 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5208 ax-sep 5221 ax-nul 5228 ax-pow 5286 ax-pr 5350 ax-un 7578 ax-cnex 10937 ax-resscn 10938 ax-1cn 10939 ax-icn 10940 ax-addcl 10941 ax-addrcl 10942 ax-mulcl 10943 ax-mulrcl 10944 ax-mulcom 10945 ax-addass 10946 ax-mulass 10947 ax-distr 10948 ax-i2m1 10949 ax-1ne0 10950 ax-1rid 10951 ax-rnegex 10952 ax-rrecex 10953 ax-cnre 10954 ax-pre-lttri 10955 ax-pre-lttrn 10956 ax-pre-ltadd 10957 ax-pre-mulgt0 10958 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3071 df-rab 3073 df-v 3431 df-sbc 3716 df-csb 3832 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-pss 3905 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5074 df-opab 5136 df-mpt 5157 df-tr 5191 df-id 5484 df-eprel 5490 df-po 5498 df-so 5499 df-fr 5539 df-we 5541 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-rn 5595 df-res 5596 df-ima 5597 df-pred 6195 df-ord 6262 df-on 6263 df-lim 6264 df-suc 6265 df-iota 6384 df-fun 6428 df-fn 6429 df-f 6430 df-f1 6431 df-fo 6432 df-f1o 6433 df-fv 6434 df-riota 7224 df-ov 7270 df-oprab 7271 df-mpo 7272 df-om 7703 df-1st 7820 df-2nd 7821 df-frecs 8084 df-wrecs 8115 df-recs 8189 df-rdg 8228 df-1o 8284 df-2o 8285 df-er 8485 df-en 8721 df-dom 8722 df-sdom 8723 df-fin 8724 df-card 9707 df-pnf 11021 df-mnf 11022 df-xr 11023 df-ltxr 11024 df-le 11025 df-sub 11217 df-neg 11218 df-nn 11984 df-n0 12244 df-z 12330 df-uz 12593 df-fz 13250 df-fzo 13393 df-hash 14055 df-word 14228 df-pmtr 19060 |
This theorem is referenced by: pmtrdifwrdel 19103 pmtrdifwrdel2 19104 |
Copyright terms: Public domain | W3C validator |