Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wrdexg | Structured version Visualization version GIF version |
Description: The set of words over a set is a set. (Contributed by Mario Carneiro, 26-Feb-2016.) |
Ref | Expression |
---|---|
wrdexg | ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wrdval 13308 | . 2 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 = ∪ 𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙))) | |
2 | mapsspw 7893 | . . . . . 6 ⊢ (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 ((0..^𝑙) × 𝑆) | |
3 | elfzoelz 12470 | . . . . . . . . 9 ⊢ (𝑠 ∈ (0..^𝑙) → 𝑠 ∈ ℤ) | |
4 | 3 | ssriv 3607 | . . . . . . . 8 ⊢ (0..^𝑙) ⊆ ℤ |
5 | xpss1 5228 | . . . . . . . 8 ⊢ ((0..^𝑙) ⊆ ℤ → ((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆)) | |
6 | 4, 5 | ax-mp 5 | . . . . . . 7 ⊢ ((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆) |
7 | sspwb 4917 | . . . . . . 7 ⊢ (((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆) ↔ 𝒫 ((0..^𝑙) × 𝑆) ⊆ 𝒫 (ℤ × 𝑆)) | |
8 | 6, 7 | mpbi 220 | . . . . . 6 ⊢ 𝒫 ((0..^𝑙) × 𝑆) ⊆ 𝒫 (ℤ × 𝑆) |
9 | 2, 8 | sstri 3612 | . . . . 5 ⊢ (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
10 | 9 | rgenw 2924 | . . . 4 ⊢ ∀𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
11 | iunss 4561 | . . . 4 ⊢ (∪ 𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) ↔ ∀𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆)) | |
12 | 10, 11 | mpbir 221 | . . 3 ⊢ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
13 | zex 11386 | . . . . 5 ⊢ ℤ ∈ V | |
14 | xpexg 6960 | . . . . 5 ⊢ ((ℤ ∈ V ∧ 𝑆 ∈ 𝑉) → (ℤ × 𝑆) ∈ V) | |
15 | 13, 14 | mpan 706 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (ℤ × 𝑆) ∈ V) |
16 | pwexg 4850 | . . . 4 ⊢ ((ℤ × 𝑆) ∈ V → 𝒫 (ℤ × 𝑆) ∈ V) | |
17 | 15, 16 | syl 17 | . . 3 ⊢ (𝑆 ∈ 𝑉 → 𝒫 (ℤ × 𝑆) ∈ V) |
18 | ssexg 4804 | . . 3 ⊢ ((∪ 𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) ∧ 𝒫 (ℤ × 𝑆) ∈ V) → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ∈ V) | |
19 | 12, 17, 18 | sylancr 695 | . 2 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑𝑚 (0..^𝑙)) ∈ V) |
20 | 1, 19 | eqeltrd 2701 | 1 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 1990 ∀wral 2912 Vcvv 3200 ⊆ wss 3574 𝒫 cpw 4158 ∪ ciun 4520 × cxp 5112 (class class class)co 6650 ↑𝑚 cmap 7857 0cc0 9936 ℕ0cn0 11292 ℤcz 11377 ..^cfzo 12465 Word cword 13291 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-map 7859 df-pm 7860 df-neg 10269 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-word 13299 |
This theorem is referenced by: wrdexb 13316 wrdexi 13317 wrdnfi 13338 elovmpt2wrd 13347 elovmptnn0wrd 13348 wrd2f1tovbij 13703 frmdbas 17389 frmdplusg 17391 vrmdfval 17393 efgval 18130 frgp0 18173 frgpmhm 18178 vrgpf 18181 vrgpinv 18182 frgpupf 18186 frgpup1 18188 frgpup2 18189 frgpup3lem 18190 frgpnabllem1 18276 frgpnabllem2 18277 ablfaclem1 18484 israg 25592 wksfval 26505 wksv 26515 wwlks 26727 clwwlks 26879 sseqval 30450 upwlksfval 41716 |
Copyright terms: Public domain | W3C validator |