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

Theorem csbwrdg 13895
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 13863 . . 3 Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
21csbeq2i 3891 . 2 𝑆 / 𝑥Word 𝑥 = 𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
3 sbcrex 3858 . . . . 5 ([𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥)
4 sbcfg 6512 . . . . . . 7 (𝑆𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥𝑆 / 𝑥𝑤:𝑆 / 𝑥(0..^𝑙)⟶𝑆 / 𝑥𝑥))
5 csbconstg 3902 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥𝑤 = 𝑤)
6 csbconstg 3902 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥(0..^𝑙) = (0..^𝑙))
7 csbvarg 4383 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥𝑥 = 𝑆)
85, 6, 7feq123d 6503 . . . . . . 7 (𝑆𝑉 → (𝑆 / 𝑥𝑤:𝑆 / 𝑥(0..^𝑙)⟶𝑆 / 𝑥𝑥𝑤:(0..^𝑙)⟶𝑆))
94, 8bitrd 281 . . . . . 6 (𝑆𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥𝑤:(0..^𝑙)⟶𝑆))
109rexbidv 3297 . . . . 5 (𝑆𝑉 → (∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
113, 10syl5bb 285 . . . 4 (𝑆𝑉 → ([𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
1211abbidv 2885 . . 3 (𝑆𝑉 → {𝑤[𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆})
13 csbab 4389 . . 3 𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤[𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
14 df-word 13863 . . 3 Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}
1512, 13, 143eqtr4g 2881 . 2 (𝑆𝑉𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆)
162, 15syl5eq 2868 1 (𝑆𝑉𝑆 / 𝑥Word 𝑥 = Word 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  {cab 2799  wrex 3139  [wsbc 3772  csb 3883  wf 6351  (class class class)co 7156  0cc0 10537  0cn0 11898  ..^cfzo 13034  Word cword 13862
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-fun 6357  df-fn 6358  df-f 6359  df-word 13863
This theorem is referenced by:  elovmpowrd  13910
  Copyright terms: Public domain W3C validator