| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wrdval | Structured version Visualization version GIF version | ||
| Description: Value of the set of words over a set. (Contributed by Stefan O'Rear, 10-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| wrdval | ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 = ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-word 14639 | . 2 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
| 2 | eliun 4955 | . . . 4 ⊢ (𝑤 ∈ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤 ∈ (𝑆 ↑m (0..^𝑙))) | |
| 3 | ovex 7445 | . . . . . 6 ⊢ (0..^𝑙) ∈ V | |
| 4 | elmapg 8843 | . . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ (0..^𝑙) ∈ V) → (𝑤 ∈ (𝑆 ↑m (0..^𝑙)) ↔ 𝑤:(0..^𝑙)⟶𝑆)) | |
| 5 | 3, 4 | mpan2 704 | . . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝑤 ∈ (𝑆 ↑m (0..^𝑙)) ↔ 𝑤:(0..^𝑙)⟶𝑆)) |
| 6 | 5 | rexbidv 3187 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (∃𝑙 ∈ ℕ0 𝑤 ∈ (𝑆 ↑m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 7 | 2, 6 | bitrid 286 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (𝑤 ∈ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 8 | 7 | eqabdv 2894 | . 2 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
| 9 | 1, 8 | eqtr4id 2815 | 1 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 = ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 {cab 2739 ∃wrex 3087 Vcvv 3451 ∪ ciun 4951 ⟶wf 6527 (class class class)co 7412 ↑m cmap 8831 0cc0 11181 ℕ0cn0 12587 ..^cfzo 13768 Word cword 14638 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-map 8833 df-word 14639 |
| This theorem is used by: wrdexg 14649 |
| Copyright terms: Public domain | W3C validator |