MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  wrdval Structured version   Visualization version   GIF version

Theorem wrdval 14478
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.)
Assertion
Ref Expression
wrdval (𝑆𝑉 → Word 𝑆 = 𝑙 ∈ ℕ0 (𝑆m (0..^𝑙)))
Distinct variable groups:   𝑆,𝑙   𝑉,𝑙

Proof of Theorem wrdval
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 df-word 14476 . 2 Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}
2 eliun 4937 . . . 4 (𝑤 𝑙 ∈ ℕ0 (𝑆m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤 ∈ (𝑆m (0..^𝑙)))
3 ovex 7400 . . . . . 6 (0..^𝑙) ∈ V
4 elmapg 8786 . . . . . 6 ((𝑆𝑉 ∧ (0..^𝑙) ∈ V) → (𝑤 ∈ (𝑆m (0..^𝑙)) ↔ 𝑤:(0..^𝑙)⟶𝑆))
53, 4mpan2 692 . . . . 5 (𝑆𝑉 → (𝑤 ∈ (𝑆m (0..^𝑙)) ↔ 𝑤:(0..^𝑙)⟶𝑆))
65rexbidv 3161 . . . 4 (𝑆𝑉 → (∃𝑙 ∈ ℕ0 𝑤 ∈ (𝑆m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
72, 6bitrid 283 . . 3 (𝑆𝑉 → (𝑤 𝑙 ∈ ℕ0 (𝑆m (0..^𝑙)) ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
87eqabdv 2869 . 2 (𝑆𝑉 𝑙 ∈ ℕ0 (𝑆m (0..^𝑙)) = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆})
91, 8eqtr4id 2790 1 (𝑆𝑉 → Word 𝑆 = 𝑙 ∈ ℕ0 (𝑆m (0..^𝑙)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  {cab 2714  wrex 3061  Vcvv 3429   ciun 4933  wf 6494  (class class class)co 7367  m cmap 8773  0cc0 11038  0cn0 12437  ..^cfzo 13608  Word cword 14475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-map 8775  df-word 14476
This theorem is referenced by:  wrdexg  14486
  Copyright terms: Public domain W3C validator