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

Theorem csbwrdg 13887
Description: Class substitution for the symbols of a word. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
Assertion
Ref Expression
csbwrdg (𝑆𝑉𝑆 / 𝑥Word 𝑥 = Word 𝑆)
Distinct variable groups:   𝑥,𝑆   𝑥,𝑉

Proof of Theorem csbwrdg
Dummy variables 𝑙 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-word 13858 . . 3 Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
21csbeq2i 3836 . 2 𝑆 / 𝑥Word 𝑥 = 𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
3 sbcrex 3804 . . . . 5 ([𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥)
4 sbcfg 6485 . . . . . . 7 (𝑆𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥𝑆 / 𝑥𝑤:𝑆 / 𝑥(0..^𝑙)⟶𝑆 / 𝑥𝑥))
5 csbconstg 3847 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥𝑤 = 𝑤)
6 csbconstg 3847 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥(0..^𝑙) = (0..^𝑙))
7 csbvarg 4339 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥𝑥 = 𝑆)
85, 6, 7feq123d 6476 . . . . . . 7 (𝑆𝑉 → (𝑆 / 𝑥𝑤:𝑆 / 𝑥(0..^𝑙)⟶𝑆 / 𝑥𝑥𝑤:(0..^𝑙)⟶𝑆))
94, 8bitrd 282 . . . . . 6 (𝑆𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥𝑤:(0..^𝑙)⟶𝑆))
109rexbidv 3256 . . . . 5 (𝑆𝑉 → (∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
113, 10syl5bb 286 . . . 4 (𝑆𝑉 → ([𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
1211abbidv 2862 . . 3 (𝑆𝑉 → {𝑤[𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆})
13 csbab 4345 . . 3 𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤[𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
14 df-word 13858 . . 3 Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}
1512, 13, 143eqtr4g 2858 . 2 (𝑆𝑉𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆)
162, 15syl5eq 2845 1 (𝑆𝑉𝑆 / 𝑥Word 𝑥 = Word 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1538  wcel 2111  {cab 2776  wrex 3107  [wsbc 3720  csb 3828  wf 6320  (class class class)co 7135  0cc0 10526  0cn0 11885  ..^cfzo 13028  Word cword 13857
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-fun 6326  df-fn 6327  df-f 6328  df-word 13858
This theorem is referenced by:  elovmpowrd  13901
  Copyright terms: Public domain W3C validator