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

Theorem csbwrdg 14669
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 14639 . . 3 Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
21csbeq2i 3855 . 2 ⦋𝑆 / 𝑥⦌Word 𝑥 = ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
3 sbcrex 3822 . . . . 5 ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥)
4 sbcfg 6699 . . . . . . 7 (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥))
5 csbconstg 3866 . . . . . . . 8 (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑤 = 𝑤)
6 csbconstg 3866 . . . . . . . 8 (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌(0..^𝑙) = (0..^𝑙))
7 csbvarg 4392 . . . . . . . 8 (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑥 = 𝑆)
85, 6, 7feq123d 6690 . . . . . . 7 (𝑆 ∈ 𝑉 → (⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥 ↔ 𝑤:(0..^𝑙)⟶𝑆))
94, 8bitrd 282 . . . . . 6 (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ 𝑤:(0..^𝑙)⟶𝑆))
109rexbidv 3187 . . . . 5 (𝑆 ∈ 𝑉 → (∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
113, 10bitrid 286 . . . 4 (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
1211abbidv 2827 . . 3 (𝑆 ∈ 𝑉 → {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆})
13 csbab 4398 . . 3 ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
14 df-word 14639 . . 3 Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}
1512, 13, 143eqtr4g 2821 . 2 (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆)
162, 15eqtrid 2808 1 (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌Word 𝑥 = Word 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087  [wsbc 3739  ⦋csb 3847  ⟶wf 6527  (class class class)co 7412  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-pr 5391
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-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6533  df-fn 6534  df-f 6535  df-word 14639
This theorem is used by:  elovmpowrd  14683
  Copyright terms: Public domain W3C validator