| 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 14479 | . 2 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
| 2 | eliun 4959 | . . . 4 ⊢ (𝑤 ∈ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤 ∈ (𝑆 ↑m (0..^𝑙))) | |
| 3 | ovex 7420 | . . . . . 6 ⊢ (0..^𝑙) ∈ V | |
| 4 | elmapg 8812 | . . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ (0..^𝑙) ∈ V) → (𝑤 ∈ (𝑆 ↑m (0..^𝑙)) ↔ 𝑤:(0..^𝑙)⟶𝑆)) | |
| 5 | 3, 4 | mpan2 691 | . . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝑤 ∈ (𝑆 ↑m (0..^𝑙)) ↔ 𝑤:(0..^𝑙)⟶𝑆)) |
| 6 | 5 | rexbidv 3157 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (∃𝑙 ∈ ℕ0 𝑤 ∈ (𝑆 ↑m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 7 | 2, 6 | bitrid 283 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (𝑤 ∈ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 8 | 7 | eqabdv 2861 | . 2 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
| 9 | 1, 8 | eqtr4id 2783 | 1 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 = ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 {cab 2707 ∃wrex 3053 Vcvv 3447 ∪ ciun 4955 ⟶wf 6507 (class class class)co 7387 ↑m cmap 8799 0cc0 11068 ℕ0cn0 12442 ..^cfzo 13615 Word cword 14478 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-map 8801 df-word 14479 |
| This theorem is referenced by: wrdexg 14489 |
| Copyright terms: Public domain | W3C validator |